A Branch-and-Cut method for the Capacitated Location-Routing Problem

Computers and Operations Research

Volumn 38, Issue 6, 2011, Pages 931-941

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

^a UNIVERSITY OF VALENCIA   (Spain)

^b UNIVERSITÉ DE TECHNOLOGIE DE TROYES   (France)

^c UNIVERSITÉ PARIS 13   (France)

Author keywords

Branch and Cut; Facility location; Location Routing Problem; Vehicle routing

Indexed keywords

BRANCH-AND-CUT; BRANCH-AND-CUT ALGORITHMS; CAPACITATED LOCATION; CAPACITY CONSTRAINTS; COMPUTATIONAL EVALUATION; DISTRIBUTION COSTS; EXACT APPROACH; FACILITY LOCATION; LINEAR MODEL; LOCATION-ROUTING PROBLEM; LOGISTIC NETWORKS; OPTIMALITY; ROUTING DECISIONS; VALID INEQUALITY; ZERO-ONE;

CUSTOMER SATISFACTION; SALES;

LOCATION;

EID: 78549293214     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2010.09.019     Document Type: Article

References (36)

1. Z. Akca, R.T. Berger, and T.K. Ralphs A branch-and-price algorithm for combined location and routing problems under capacity restrictions J.W. Chinneck, B. Kristjansson, M.J. Saltzman, Operations research and cyber-infrastructure vol. 47 2009 Springer US 309 330
2. M. Albareda-Sambola, J.A. Daz, and E. Fernndez A compact model and tight bounds for a combined location-routing problem Computers & Operations Research 32 2005 407 428
3. M. Albareda-Sambola, E. Fernndez, and G. Laporte Heuristic and lower bounds for a stochastic location routing problem European Journal of Operational Research 179 2007 940 955
4. Applegate D, Bixby RE, Chvtal V, Cook W. Finding cuts in the TSP. Technical Report 95-05, DIMACS; 1995.
5. P. Augerat, J.M. Belenguer, E. Benavent, A. Corbern, and D. Naddef Separating capacity inequalities in the CVRP using tabu search European Journal of Operational Research 106 1998 546 557
6. Augerat P, Belenguer JM, Benavent E, Corbern A, Naddef D, Rinaldi G. Computational results with a branch-and-cut code for the capacitated vehicle routing problem. Technical Report RR949-M, ARTEMIS-IMAG, France; 1995.
7. F. Barahona, and M. Grtschel On the cycle polytope of a binary matroid Journal of Combinatorial Theory 40 1986 40 62
8. Barreto SS. Anlise e Modelizao de Problemas de localizao-distribuio [Analysis and modelling of location-routing problems]. PhD thesis, University of Aveiro, campus universitrio de Santiago, 3810-193 Aveiro, Portugal; October 2004 [in Portuguese].
9. J.M. Belenguer, E. Benavent, C. Prins, C. Prodhon, and R. Wolfler-Calvo A branch and cut method for the capacitated location-routing problem Proceedings of the IEEE international conference on service systems and service management (ICSSSM'06) vol. 2 2006 1541 1546
10. A. Bruns, and A. Klose A "locate first-route second" heuristic for a combined location-routing problem U. Zimmermann, U. Derigs, W. Gaul, R.H. Mhring, K.P. Schuster, Operations research proceedings 1996 1996 Springer 49 54
11. Y. Chan, W.B. Carter, and M.D. Burnes A multiple-depot, multiple-vehicle, location-routing problem with stochastically processed demands Computers & Operations Research 28 8 2001 803 826
12. T.W. Chien Heuristic procedures for practical-sized uncapacitated location-capacitated routing problems Decision Science 24 5 1993 995 1021
13. G. Ghiani, and G. Laporte A branch-and-cut algorithm for the undirected rural postman problem Mathematical Programming 87 3 2000 467 481
14. G. Ghiani, and G. Laporte Location-arc routing problems OPSEARCH 38 2 2001 151 159
15. Golden B, Raghavan S, Wasil E, editors. The vehicle routing problem: latest advances and new challenges. In: Operations research/computer science interfaces series, vol. 43. Springer; 2008.
16. Labadi N. Problmes tactiques et stratgiques en tournes sur arcs [Tactical and strategic problems in arc routing]. PhD thesis, Universit de Technologie de Troyes, Troyes, France; 2003 [in French].
17. G. Laporte, F. Louveaux, and H. Mercure Models and exact solutions for a class of stochastic location-routing problems European Journal of Operational Research 39 1989 71 78
18. G. Laporte, and Y. Nobert An exact algorithm for minimizing routing and operating costs in depot location European Journal of Operational Research 6 1981 224 226
19. G. Laporte, Y. Nobert, and D. Arpin An exact algorithm for solving a capacitated location-routing problem Annals of Operations Research 6 1986 293 310
20. G. Laporte, Y. Nobert, and S. Taillefer Solving a family of multi-depot vehicle routing and location-routing problems Transportation Science 22 3 1988 161 172
21. A.N. Letchford, G. Reinelt, and D.O. Theis Odd minimum cut sets and b-matchings revisited SIAM Journal on Discrete Mathematics 22 4 2008 1480 1487
22. Lysgaard J. A CVRPSEP package, 〈 http://www.hha.dk/∼lys/CVRPSEP. htm 〉 ; 2004.
23. J. Lysgaard, A.N. Letchford, and R.W. Eglese A new branch-and-cut algorithm for the capacitated vehicle routing problem Mathematical Programming 100 2 2004 423 445 (Pubitemid 40878095)
24. H. Min, V. Jayaraman, and R. Srivastava Combined location-routing problems: a synthesis and future research directions European Journal of Operational Research 108 1 1998 1 15
25. D. Naddef, and G. Rinaldi Branch-and-cut algorithms for the capacitated VRP P. Toth, D. Vigo, The vehicle routing problem, SIAM monographs on discrete mathematics applications vol. 9 2002 53 84
26. G. Nagy, and S. Salhi The many-to-many location-routing problem Top 6 2 1998 261 275
27. M.W. Padberg, and G. Rinaldi A branch and cut algorithm for the resolution of large-scale symmetric traveling salesmen problems SIAM Review 33 1991 60 100
28. C. Prins, C. Prodhon, A. Ruiz, P. Soriano, and R. Wolfler-Calvo Solving the capacitated location-routing problem by a cooperative Lagrangean relaxation-granular tabu search heuristic Transportation Science 41 4 2007 470 483
29. Prins C, Prodhon C, Wolfler-Calvo R. A memetic algorithm with population management (MA | PM ) for the capacitated location-routing problem. In: Gottlieb J, Raidl GR, editors. Proceedings of EvoCOP2006 (evolutionary computation in combinatorial optimization: 6th european conference, Budapest, Hungary, April 1012, 2006), Lecture notes in computer science, vol. 3906. Springer; 2006. p. 18394.
30. C. Prins, C. Prodhon, and R. Wolfler-Calvo Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking 4ORA Quarterly Journal of Operations Research 4 2006 221 238
31. T.K. Ralphs, L. Kopman, W.R. Pulleyblank, and L.E. Trotter On the capacitated vehicle routing problem Mathematical Programming 94 2003 343 359
32. S. Salhi, and G.K. Rand The effect of ignoring routes when locating depots European Journal of Operational Research 39 2 1989 150 156
33. R. Srivastava Alternate solution procedures for the locating-routing problem OMEGA International Journal of Management Science 21 4 1993 497 506
34. Toth P, Vigo D, editors. The vehicle routing problem. SIAM monographs on discrete mathematics Applications, vol. 9, 2002.
35. D. Tuzun, and L.I. Burke A two-phase tabu search approach to the location routing problem European Journal of Operational Research 116 1 1999 87 99
36. T.H. Wu, C. Low, and J. W Bai Heuristic solutions to multi-depot location-routing problems Computers & Operations Research 29 10 2002 1393 1415