Hubbing and routing in postal delivery systems
We consider the combined hubbing and routing problem in postal delivery systems and develop an iterative two-stage solution procedure for the problem. In the first stage, hub locations are determined and postal offices are multiply allocated to the hubs. The second stage gives the routes in hub regions that alter the distances between points used in the hub-location problem. The procedure then iterates between two stages by updating the distances used in hubbing in order to produce a route-compatible hub configuration. Computational experience is reported for the test problems taken from the literature. For a case study Turkish postal delivery system data are utilized. As the case study is applied on a road network, a final stage, seeking improvements based on special structures in the routed network, is appended to the two-stage solution procedure.
KeywordsLocation Vehicle routing Heuristics
Unable to display preview. Download preview PDF.
- Campbell, J. F., Ernst, A. T., & Krishnamoorthy, M. (2001). Hub location problems. In Z. Drezner, & H. W. Hamacher (Eds.), Facility location, applications and theory (pp. 373–407). Berlin: Springer. Google Scholar
- Çetiner, S. (2003). An iterative hub location and routing problem for postal delivery systems. MS Thesis, METU Ankara. Google Scholar
- Daskin, M. S. (1995). Network and discrete location: models, algorithms and applications. New York: Wiley. Google Scholar
- Ernst, A. T., & Krishnamoorthy, M. (1998). An exact solution approach based on shortest-paths for p-hub median problems. Journal on Computing, 10(2), 149–162. Google Scholar
- Fotheringham, A. S. (1983). A new set of spatial interaction models: The theory of competing destinations. Environment and Planning A, 15–36. Google Scholar
- Maheshwari, B. E. (2004). A network design model for multi-zone truckload shipments. MS Thesis, Texas A&M University. Google Scholar
- Metters, R. D. (1996). Interdependent transportation and production activity at the united states postal service. Journal of Operational Research Society, 47(1), 27–37. Google Scholar
- Miller, C. E., Tucker, A. W., & Zemlin, R. A. (1960). Integer programming formulation traveling salesman problems. Journal of Association for Computing Machinery, 7, 326–329. Google Scholar
- Nagy, G., & Salhi, S. (1996). Nested heuristic methods for the location-routing problem. Journal of Operational Research Society, 47, 1166–1174. Google Scholar
- Or, I., & Pierskalla, W. P. (1979). A transportation location-allocation model for regional blood banking. AIIE Transactions, 11(2), 86–95. Google Scholar
- Tsigirilides, T. (1984). Heuristic methods applied to orienteering. Journal of the Operational Research Society, 35, 797–809. Google Scholar