A Two-Phase Meta Heuristic Approach to the Location-Routing Problem for Transportation Network Planning

Abstract:

In this paper we consider the location-routing problem which combines the facility location and the vehicle routing decisions. In this type of problem, we have to determine the location of facilities within a set of possible locations and routes of the vehicles to meet the demands of number of customers. Since the location-routing problem is NP-hard, it is difficult to obtain optimal solution within a reasonable computational time. Therefore, a two-phase ant colony optimization algorithm is developed which solves facility location problem and vehicle routing problem hierarchically. Its performance is examined through a comparative study. The experimental results show that the proposed ant colony optimization algorithm can be a viable solution method for the general transportation network planning.

• Periodical: Applied Mechanics and Materials (Volumes 361-363)
• Pages: 1900-1905
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.361-363.1900
• Online since: August 2013
• Authors: Ji Ung Sun
• Keywords: Ant Colony Optimization (ACO), Location-Routing Problem, Transportation Network

References

[1] I. Karaoglan, F. Altiparmak, I. Kara and B. Dengiz: The location-routing problem with simultaneous pickup and delivery: Formulations and a heuristic approach. Omega. Vol. 40 (2012), p.465~477.

DOI: 10.1016/j.omega.2011.09.002

[2] 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

[3] J.M. Nambiar, L.F. Gelders and L.N. Van Wassenhove: A large scale location-allocation problem in the natural rubber industry. European Journal of Operational Research. Vol. 6 (1981), p.183~189.

DOI: 10.1016/0377-2217(81)90205-8

[4] I.M. Branco and J.D. Coelho: The Hamiltonian p-median problem. European Journal of Operational Research. Vol. 47 (1990), p.86~95.

DOI: 10.1016/0377-2217(90)90092-p

[5] H. Min: Consolidation terminal location-allocation and consolidated routing problems. Journal of Business Logistics. Vol. 17 (1996), p.235~263.

[6] A. Billionnet, S. Elloumi and L. Grouz-Djerbi: Designing radio-mobile access networks based on synchronous digital hierarchy rings. Computers and Operations Research. Vol. 32 (2005), p.379~394.

DOI: 10.1016/s0305-0548(03)00242-9

[7] J. Perl and M.S. Daskin: A warehouse location-routing problem. Transportation Research. Vol. 19 (1985), p.381~396.

DOI: 10.1016/0191-2615(85)90052-9

[8] S. Salhi and M. Fraser: An integrated heuristic approach for the combined location vehicle fleet mix problem. Studies in Locational Analysis. Vol. 8 (1996), p.3~21.

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

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

[10] M. Schwardt and J. Dethloff: Solving a continuous location-routing problem by use of a self-organising map. International Journal of Physical Distribution and Logistics Management. Vol. 35 (2005), p.390~408.

DOI: 10.1108/09600030510611639

[11] 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

[12] J. Melechovsky, C. Prins and R. Wolfler Calvo: A metaheuristic to solve a location-routing problem with non-linear costs. Journal of Heuristics. Vol. 11 (2005), p.375~391.

DOI: 10.1007/s10732-005-3601-1

[13] M. Dorigo and T. , in: Ant Colony Optimization, MIT Press, Boston. (2004).

[14] R. Srivastava: Alternate solution procedures for the location-routing problem. Omega International Journal of Management Science. Vol. 21 (1993), p.497~506.

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