In this study, we consider the Turkish postal delivery system and develop
an effective solution approach for the combined hub location and routing problem
where the location of hub nodes are determined, the nonhub regional postal
offices are allocated to the hubs, and the optimal set of routes are determined for
each hub. Since the realized post-routing distances between origin-destination
pairs are different from those used in the hub-location model, we develop an
algorithm that finds the route-compatible hub configuration and allocation paths.
The algorithm is the one that iterates between the hub-location phase and a routing
phase. Our strategy consists of updating the distances used in the first phase in
order to produce a solution that contains the cognition of routes. Some special
structures in the routed network are also identified and used for improving the
solution. Computational experience is reported.
| Identifer | oai:union.ndltd.org:METU/oai:etd.lib.metu.edu.tr:http://etd.lib.metu.edu.tr/upload/4/759399/index.pdf |
| Date | 01 January 2003 |
| Creators | Cetiner, Selim |
| Contributors | Sepil, Canan |
| Publisher | METU |
| Source Sets | Middle East Technical Univ. |
| Language | English |
| Detected Language | English |
| Type | M.S. Thesis |
| Format | text/pdf |
| Rights | To liberate the content for public access |
Page generated in 0.0018 seconds