A branch and cut method for the capacitated location-routing problem

Proceedings - ICSSSM'06: 2006 International Conference on Service Systems and Service Management

Volumn 2, Issue , 2006, Pages 1541-1546

  Belenguer, Jose Manuel ^a   Benavent, Enrique ^a   Prins, Christian ^b   Prodhon, Caroline ^b   Wolfler Calvo, Roberto ^b  

^a UNIVERSITY OF VALENCIA   (Spain)

^b UNIVERSITÉ DE TECHNOLOGIE DE TROYES   (France)

Author keywords

Branch and cut; Location routing; Lower bound

Indexed keywords

DECISION THEORY; HEURISTIC METHODS; PROBLEM SOLVING; RANDOM PROCESSES;

LOCATION-ROUTING; LOWER BOUND;

TRACKING (POSITION);

EID: 40649089717     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICSSSM.2006.320765     Document Type: Conference Paper

References (19)

1. M. Albareda-Sambola, J.A. Díaz and E. Fernández, “A Compact Model and Tight Bounds for a Combined Location-Routing Problem”, Computers and Operations Research, Vol. 32, pp 407-428, 2005.
2. S. S. Barreto, 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, 2004.
3. A. Bruns and A. Klose, “A “Locate First-Route Second” Heuristic for a combined Location-Routeing Problem”, Operations Research Proceedings, U. Zimmermann, U. Derigs, W. Gaul, R.H. Mohring and K.P. Schuster Edt, Springer, 1996.
4. Y. Chan, W.B. Carter and M.D. Burnes, “A Multiple-Depot, Multiple-Vehicle, Location-Routing Problem with Stochastically Processed Demands”, Computers and Operations Research, Vol. 28, pp 803-826, 2001.
5. T. W. Chien, “Heuristic Procedures for Practical-Sized Uncapacitated Location-Capacitated Routing Problems”, Decision Sciences, Vol. 24, No. 5, pp 995-1021, 1993.
6. G. Ghiani and G. Laporte, “Location-arc Routing Problems”, OPSEARCH, Vol. 38, pp 151-159, 2001.
7. N. Labadi, Problèmes tactiques et stratégiques en tournées sur arcs [Tactical and strategic problems on arc routing], Ph.D. thesis, University of Technology of Troyes, 2003.
8. G. Laporte, Y. Nobert and D. Arpin, “An exact algorithm for solving a capacitated location-routing problem”, Annals of Operations Research, Vol. 6, pp 293-310, 1986.
9. G. Laporte, Y. Norbert and S. Taillefer, “Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems”, Transportation Science, Vol. 22, No. 3, pp 161-167, 1988.
10. G. Laporte, F. Louveaux and H. Mercure, “Models and Exact Solutions for a Class of Stochastic Location-Routing Problems”, European Journal of Operational Research, Vol. 39, pp 71-78, 1989.
11. J. Lysgaard, A.N. Letchford and R.W. Eglese, “A new branch-and-cut algorithm for the capacitated vehicle routing problem”, Mathematical Programming, Vol. 100, No. 2, pp 423-445, 2004.
12. H. Min, V. Jayaraman and R. Srivastava, “Combined Location-Routing Problems: A Synthesis and Future Research Directions”, European Journal of Operational Research, Vol. 108, pp 1-15, 1998.
13. C. Prins, C. Prodhon and R. Wolfler Calvo, “A Reactive GRASP and Path Relinking algorithm for the capacitated Location Routing Problem”, IESM'05, Mar-rakech, Marroco, May 2005.
14. C. Prins, C. Prodhon, A. Ruiz, P. Soriano and R. Wolfler Calvo, “A Cooperative Lagrangean Relaxation-Granular Tabu Search Heuristic for the Capacitated Location Routing Problem”, MIC 2005, Vienna, Austria, August 2005.
15. C. Prins and C. Prodhon and R. Wolfler-Calvo, “A Memetic Algorithm with Population Management (GA/PM) for the Capacitated Location-Routing Problem”, In: Proceedings of EvoCOP2006 (Evolutionary Computation in Combinatorial Optimization: 6th European Conference, Budapest, Hungary, April 10-12, 2006), Lecture Notes in Computer Science, J. Gottlieb, G. R. Raidl (Eds), Vol. 3906, pp 183-194.
16. S. Salhi and G. K. Rand, “The Effect of Ignoring Routes when Locating Depots”, European Journal of Operational Research, Vol. 45, pp 150-156, 1989.
17. R. Srivastava, “Alternate Solution Procedures for the Locating-Routing Problem”, OMEGA International Journal of Management Science, Vol. 21, No. 4, pp 497-506, 1993.
18. D. Tuzun and L.I. Burke, “A Two-Phase Tabu Search Approach to the Location Routing Problem”, European Journal of Operational Research, Vol. 116, pp 87-99, 1999.
19. T.H. Wu, C. Low and J.W Bai, “Heuristic Solutions to Multi-Depot Location-Routing Problems”, Computers and Operations Research, Vol. 29, pp 1393-1415, 2002.