An Integrated Hub Location and Multi-Depot Vehicle Routing Problem

Abstract:

This paper considers the integrated hub location and multi-depot vehicle routing problem. In this type of problem, we have to determine the location of hubs within a set of candidate locations, allocation of customers to each selected hub location and routes of the vehicles to meet the demands of number of customers in order to minimize the total system cost. To solve these problems simultaneously we apply a hierarchical structure, which hub location as the main problem and vehicle routing as a subordinate one. An integrated solution method based on ant colony optimization algorithm is developed which solves hub location problem and vehicle routing problem hierarchically. Its performance is examined through a comparative study.

• Periodical: Applied Mechanics and Materials (Volumes 409-410)
• Pages: 1188-1192
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.409-410.1188
• Online since: September 2013
• Authors: Ji Ung Sun
• Keywords: Hierarchical Structure, Hub Location, Multi-Depot Vehicle Routing

References

[1] S. Salhi and G.K. Rand: The effect of ignoring routes when locating depots. European Journal of Operational Research. Vol. 39 (1989), p.150~156.

DOI: 10.1016/0377-2217(89)90188-4

[2] C. Ting and C. Chen: A multiple ant colony optimization algorithm for the capacitated location routing problem. International Journal of Production Economics. Vol. 141 (2013), p.34~44.

DOI: 10.1016/j.ijpe.2012.06.011

[3] R. Srivastava: Alternate solution procedures for the location-routing problem. OMEGA. Vol. 21 (1993), p.497~506.

DOI: 10.1016/0305-0483(93)90082-v

[4] S. Barreto, C. Ferreira, J. Paixao and B.S. Santos: Using clustering analysis in capacitated location-routing problem. European Journal of Operational Research. Vol. 179 (2007), p.968~977.

DOI: 10.1016/j.ejor.2005.06.074

[5] P.H. Hansen, B. Hegedahl, S. Hjortkjaer and B. Obel: A heuristic solution to the warehouse location-routing problem. European Journal of Operational Research. Vol. 76 (1994), p.111~127.

DOI: 10.1016/0377-2217(94)90010-8

[6] T.H. Wu, C. Low and J.W. Bai: Heuristic solutions to multi-depot location-routing problems. Computers & Operations Research. Vol. 29 (2002), p.1393~1415.

DOI: 10.1016/s0305-0548(01)00038-7

[7] C. Prins, C. Prodhon and C.R. Wolfler: Solving the capacitated location-routing problem by a cooperative Lagrangian relaxation-granular tabu search heuristic. Transportation Science. Vol. 41 (2007), p.470~483.

DOI: 10.1287/trsc.1060.0187

[8] C. Duhamel, P. Lacomme, C. Prins and C. Prodhon: A GRASP x ELS approach for the capacitated location-routing problem. Computers & Operations Research. Vol. 37 (2010), p.1912~(1923).

DOI: 10.1016/j.cor.2009.07.004

[9] G. Nagi and S. Salhi: Nested heuristic methods for the location-routing problem. Journal of Operational Research Society. Vol. 47 (1996), p.1166~1194.

DOI: 10.2307/3010375

[10] M. Albareda-Sambola, J.A. Diaz and E. Fernandez: A compact model and tight bounds for a combined location-routing problem. Computers and Operations Research. Vol. 32 (2005), p.407~428.

DOI: 10.1016/s0305-0548(03)00245-4

[11] G. Nagi and S. Salhi: Location-routing: Issues, models and methods. European Journal of Operational Research. Vol. 177 (2007), p.649~672.

DOI: 10.1016/j.ejor.2006.04.004