A Memetic Algorithm with Population Management (MA|PM) for the Capacitated Location-Routing Problem

  • Christian Prins
  • Caroline Prodhon
  • Roberto Wolfler Calvo
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3906)


As shown in recent researches, in a distribution system, ignoring routes when locating depots may overestimate the overall system cost. The Location Routing Problem (LRP) overcomes this drawback dealing simultaneously with location and routing decisions. This paper presents a memetic algorithm with population management (MA|PM) to solve the LRP with capacitated routes and depots. MA|PM is a very recent form of memetic algorithm in which the diversity of a small population of solutions is controlled by accepting a new solution if its distance to the population exceeds a given threshold. The method is evaluated on three sets of instances, and compared to other heuristics and a lower bound. The preliminary results are quite promising since the MA|PM already finds the best results on several instances.


Local Search Tabu Search Memetic Algorithm Vehicle Route Problem Facility Location Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Albareda-Sambola, M., Díaz, J.A., Fernández, E.: A compact model and tight bounds for a combined location-routing problem. Computers and Operations Research 32(3), 407–428 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Barreto, S.S. (2004),
  3. 3.
    Barreto, S.S.: Análise e Modelização de Problemas de localização-distribuição [Analysis and modelling of location-routing problems]. PhD thesis, University of Aveiro, campus universitário de Santiago, 3810-193 Aveiro, Portugal (October 2004) (in Portuguese)Google Scholar
  4. 4.
    Bruns, A., Klose, A.: An iterative heuristic for location-routing problems based on clustering. In: Proceedings of the second International Workshop on Distribution Logistics, Oegstgeest, The Netherlands (1995)Google Scholar
  5. 5.
    Chan, Y., Carter, W.B., Burnes, M.D.: A multiple-depot, multiple-vehicle, location-routing problem with stochastically processed demands. Computers and Operations Research 28, 803–826 (2001)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Chien, T.W.: Heuristic procedures for practical-sized uncapacitated location-capacitated routing problems. Decision Sciences 24(5), 995–1021 (1993)CrossRefGoogle Scholar
  7. 7.
    Ghiani, G., Laporte, G.: Location-arc routing problems. OPSEARCH 38, 151–159 (2001)Google Scholar
  8. 8.
    Labadi, N.: Problèmes tactiques et stratégiques en tournées sur arcs. PhD thesis, Université de Technologie de Troyes (2003)Google Scholar
  9. 9.
    Laporte, G., Louveaux, F., Mercure, H.: Models and exact solutions for a class of stochastic location-routing problems. European Journal of Operational Research 39, 71–78 (1989)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Laporte, G., Norbert, Y., Taillefer, S.: Solving a family of multi-depot vehicle routing and location-routing problems. Transportation Science 22(3), 161–167 (1988)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Lima, C.M.R.R., Goldbarg, M.C., Goldbarg, E.F.G.: A memetic algorithm for heterogeneous fleet vehicle routing problem. Electronic Notes in Discrete Mathematics (18), 171–176 (2004)Google Scholar
  12. 12.
    Lin, S., Kernighan, B.W.: An effective heuristic algorithm for the traveling salesman problem. Operations Research 21, 498–516 (1973)MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    Min, H., Jayaraman, V., Srivastava, R.: Combined location-routing problems: A synthesis and future research directions. European Journal of Operational Research 108, 1–15 (1998)CrossRefzbMATHGoogle Scholar
  14. 14.
    Prins, C.: A simple and effective evolutionary algorithm for the vehicle routing problem. Computers and Operations Research (2004)Google Scholar
  15. 15.
    Prins, C., Prodhon, C., Wolfler Calvo, R.: Nouveaux algorithmes pour le problème de localisation et routage sous contraintes de capacité. In: Dolgui, A., Dauzère-Pérès, S. (eds.) MOSIM 2004, Lavoisier, September 2004. Ecole des Mines de Nantes, vol. 2, pp. 1115–1122 (2004)Google Scholar
  16. 16.
    Prins, C., Prodhon, C., Wolfler Calvo, R.: A reactive grasp and path relinking algorithm for the capacitated location routing problem. In: IESM 2005, Marrakech, Marroco (May 2005)Google Scholar
  17. 17.
    Prins, C., Prodhon, C., Ruiz, A., Soriano, P., Wolfler Calvo, R.: A cooperative lagrangean relaxation-granular tabu search heuristic for the capacitated location routing problem. In: MIC 2005, Vienna, Austria (August 2005)Google Scholar
  18. 18.
    Prins, C., Sevaux, M., Sörensen, K.: A genetic algorithm with population management (GA | PM) for the carp. In: Tristan V (5th Triennal Symposium on Transportation Analysis), June 13-18, 2004, Le Gosier, Guadeloupe (2004)Google Scholar
  19. 19.
    Salhi, S., Rand, G.K.: The effect of ignoring routes when locating depots. European Journal of Operational Research 39, 150–156 (1989)MathSciNetCrossRefzbMATHGoogle Scholar
  20. 20.
    Sörensen, K., Sevaux, M.: MA | PM: memetic algorithms with population management. Computers and Operations Research (33), 1214–1225 (2006)Google Scholar
  21. 21.
    Srivastava, R.: Alternate solution procedures for the locating-routing problem. OMEGA International Journal of Management Science 21(4), 497–506 (1993)CrossRefGoogle Scholar
  22. 22.
    Tuzun, D., Burke, L.I.: A two-phase tabu search approach to the location routing problem. European Journal of Operational Research 116, 87–99 (1999)CrossRefzbMATHGoogle Scholar
  23. 23.
    Wu, T.H., Low, C., Bai, J.W.: Heuristic solutions to multi-depot location-routing problems. Computers and Operations Research 29, 1393–1415 (2002)CrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Christian Prins
    • 1
  • Caroline Prodhon
    • 1
  • Roberto Wolfler Calvo
    • 1
  1. 1.ISTITUniversité de Technologie de TroyesTroyesFrance

Personalised recommendations