Abstract
Location-Routing Problem (LRP) can model several life situations. In this paper we study The Capacitated Location Routing Problem (CLRP) which is defined as a combination of two problems: the Facility Location Problem (FLP) and the Vehicle Routing problem (VRP). We propose a two-phase approach to solve the CLRP. The approach is based on Simulated Annealing algorithm (SA) and Ant Colony System (ACS). The experimental results show the efficiency of our approach.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aydin, M.E.: A simulated annealing algorithm for multi-agents systems: A job shop scheduling application. Journal of Intelligent Manufacturing 15(6), 805–814 (2002)
Barreto, S.S., Ferreira, C.M., Paixão, J.M.: Using clustering analysis in a capacitated location-routing problem. In: Comunication presented at XIV Meeting of the European Working Group on Locational Analysis, Corfu, Greece, September 11-13 (2003a)
Bouhafs, L., Hajjam, A., Koukam, A.: A Hybrid Ant Colony System Approach for the Capacitated Vehicle Routing Problem. In: ANTS Workshop 2004, pp. 414–415 (2004)
Clark, G., Wright, J.W.: Scheduling of vehicles from a central depot to a number of delivery points. Operations Research 14, 568–581 (1964)
Dorigo, M., Gambardella, L.: Ant Colony System: A Cooperative Learning Approach to the Travelling Salesman Problem. IEEE Transactions on Evolutionary Computation 1(1), 53–66 (1997)
Kirkpatrick, S., Gelatt Jr., Vecchi, M.P.: Optimization by simulated annealing. Science 220, 671–680 (1983)
Laporte, G., Nobert, Y., Taillefer, S.: Solving a family of multi-depot vehicle routing and location-routing problems. Transportation Science 22(3), 161–172 (1988)
Min, H., Jayaraman, V., Srivastava, R.: Combined location-routing problems: A synthesis and future research directions. European Journal of Operational Research 108(1), 1–15 (1998)
Paessens, H.: The savings algorithm for the vehicle routing problem. Eur. J. Oper. Res. 34, 336–344 (1988)
Srivastava, L.: Alternate solution procedures for the location-routing problem. Omega International Journal of Management Science 21(4), 497–506 (1993)
Tuzun, D., Burke, L.I.: A two-phase tabu search approach to the location routing problem. European Journal of Operational Research 116(1), 87–99 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bouhafs, L., hajjam, A., Koukam, A. (2006). A Combination of Simulated Annealing and Ant Colony System for the Capacitated Location-Routing Problem. In: Gabrys, B., Howlett, R.J., Jain, L.C. (eds) Knowledge-Based Intelligent Information and Engineering Systems. KES 2006. Lecture Notes in Computer Science(), vol 4251. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11892960_50
Download citation
DOI: https://doi.org/10.1007/11892960_50
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-46535-5
Online ISBN: 978-3-540-46536-2
eBook Packages: Computer ScienceComputer Science (R0)