Abstract
This is a summary of the main results presented in the author’s Ph.D thesis, available at http://prodhonc.free.fr/homepage. This thesis, written in French, was supervised by Christian Prins and Roberto Wolfler-Calvo, and defended on 16 October 2006 at the Université de Technologie de Troyes. Several new approaches are proposed to solve the capacitated location-routing problem (CLRP): heuristic, cooperative and exact methods. Their performances are tested on various kinds of instances with capacitated vehicles and capacitated or uncapacitated depots.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Barreto SS (2004) Análise e Modelização de Problemas de localização-distribuição (Analysis and modelling of location-routing problems). Ph.D thesis, University of Aveiro, campus universitário de Santiago. Aveiro, Portugal, pp 3810–3193 (in Portuguese)
Belenguer JM, Benavent E, Prins C, Prodhon C, Wolfler-Calvo R (2006) A branch and cut method for the capacitated location-routing problem. In: ICSSSM’06, Troyes, France, pp 1541–1546, ISBN 1-4244-0451-7
Clarke G, Wright JW (1964) Scheduling of vehicles from a central depot to a number of delivery points. Oper Res 12:568–581
Feo T, Resende MGC (1995) Greedy randomized adaptive search procedures. J Global Optim 2:1–27
Lysgaard J, Letchford AN, Eglese RW (2004) A new branch-and-cut algorithm for the capacitated vehicle routing problem. Math Program 100:423–445
Min H, Jayaraman V, Srivastava R (1998) Combined location-routing problems: a synthesis and future research directions. Eur J Oper Res 108:1–15
Prins C, Prodhon C, Wolfler-Calvo R (2004) 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’04, vol 2. Ecole des Mines de Nantes, Lavoisier, pp. 1115–1122
Prins C, Prodhon C, Wolfler-Calvo R (2006a) A memetic algorithm with population management (MA | PM) for the capacitated location-routing problem. In: Gottlieb J, Raidl GR (eds) Lecture Notes in Computer Science, vol 3906. Proceedings of EvoCOP2006 (Evolutionary computation in combinatorial optimization: 6th European conference, Budapest, Hungary, April 10–12, 2006), Springer, Heidelberg, pp 183–194
Prins C, Prodhon C, Wolfler-Calvo R (2006b) Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking. 4OR, 4:221–238
Prins C, Prodhon C, Wolfler-Calvo R (to appear) Solving the capacitated location-routing problem by a cooperative Lagrangean relaxation-granular tabu search heuristic. Transp Sci
Salhi S, Rand GK (1989) The effect of ignoring routes when locating depots. Eur J Oper Res 39:150–156
Sörensen K, Sevaux M (2003) GA | PM: genetic algorithms with population management for permutation problems. In: MIC2003
Toth P, Vigo D (2003) The granular tabu search (and its application to the vehicle routing problems). INFORMS J Comput 15(4):333–346
Tuzun D, Burke LI (1999) A two-phase tabu search approach to the location routing problem. Eur J Oper Res 116:87–99
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Prodhon, C. Solving the capacitated location-routing problem. 4OR 5, 339–342 (2007). https://doi.org/10.1007/s10288-007-0039-3
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10288-007-0039-3