An exact method for the capacitated location-routing problem

Operations Research

Volumn 59, Issue 5, 2011, Pages 1284-1296

  Baldacci, Roberto ^a   Mingozzi, Aristide ^a   Calvo, Roberto Wolfler ^b  

^a UNIVERSITY OF BOLOGNA   (Italy)

^b Laboratoire d'Informatique de Paris Nord Villetaneuse   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDING PROCEDURES; COMPUTATIONAL RESULTS; EXACT METHODS; FIXED COST; LOCATION ROUTING PROBLEM; LOCATION-ROUTING; LOWER BOUNDS; OPTIMALITY; SET OF CUSTOMERS; SET PARTITIONING; SUBJECT CLASSIFICATION; VEHICLE ROUTING PROBLEM;

BENCHMARKING; COST ACCOUNTING;

DYNAMIC PROGRAMMING;

EID: 81455141797     PISSN: 0030364X     EISSN: 15265463     Source Type: Journal    
DOI: 10.1287/opre.1110.0989     Document Type: Article

References (32)

1. Akca, Z., R. T. Berger, T. K. Ralphs. 2009. A branch-and-price algorithm for combined location and routing problems under capacity restrictions. J. W. Chinneck, B. Kristjansson, M. J. Saltzman, eds. Operations Research and Cyber-Infrastructure, Vol. 47. Springer, 309-330.
2. Albareda-Sambola, M., J. A. Diaz, E. Fernandez. 2005. A compact model and tight bounds for a combined location-routing problem. Comput. Oper. Res. 32(3) 407-428.
3. Baldacci, R., A. Mingozzi. 2009. A unified exact method for solving different classes of vehicle routing problems. Math. Programming Ser. A 120(2) 347-380.
4. Barreto, S., C. Ferreira, J. Paixao, B. S. Santos. 2007. Using clustering analysis location-routing in a capacitated problem. Eur. J. Oper. Res. 179(3) 968-977. (Pubitemid 46038597)
5. Belenguer, J.-M., E. Benavent, C. Prins, C. Prodhon, R. Wolfler Calvo. 2011. A branch-and-cut method for the capacitated location-routing problem. Comput. Oper. Res. 38(6) 931-941.
6. Billionnet, A., S. Elloumi, L. G. Djerbi. 2005. Designing radio-mobile access networks based on synchronous digital hierarchy rings. Comput. Oper. Res. 32(2) 379-394.
7. Bruns, A., A. Klose. 1996. A "locate first-route second" heuristic for a combined location-routing problem. U. Zimmermann, U. Derigs, W. Gaul, R. H. Mohring, K. P. Schuster, eds. Operations Research Proceedings. Springer-Verlag, 49-54.
8. Chan, Y. P., W. B. Carter, M. D. Burnes. 2001. A multiple-depot, multiple-vehicle, location-routing problem with stochastically processed demands. Comput. Oper. Res. 28(8) 803-826. (Pubitemid 32473738)
9. Chien, T. W. 1993. Heuristic procedures for practical-sized uncapacitated location-capacitated routing problems. Decision Sci. 24(5) 995-1021.
10. Christofides, N., A. Mingozzi, P. Toth. 1981. Exact algorithms for the vehicle routing problem based on spanning tree and shortest path relaxations. Math. Programming 10(1) 255-280.
11. CPLEX. 2008. ILOG CPLEX 11.0 Callable Library. ILOG.
12. Gunnarsson, H., M. Ronnqvist, D. Carlsson. 2005. A combined terminal location and ship routing problem. J. Oper. Res. Soc. 57(8) 928-938.
13. Kulcar, T. 1996. Optimizing solid waste collection in Brussels. Eur. J. Oper. Res. 90(1) 71-77. (Pubitemid 126392352)
14. Labbé, M., G. Laporte. 1986. Maximizing user convenience and postal service efficiency in post box location. Belgian J. Oper. Res. Statist. Comput. Sci. 26 21-35.
15. Laporte, G. 1988. Location-routing problems. B. L. Golden, A. A. Assad, eds. Vehicle Routing: Methods and Studies. North Holland, Amsterdam, 163-196.
16. Laporte, G., F. Louveaux, H. Mercure. 1989. Models and exact solutions for a class of stochastic location-routing problems. Eur. J. Oper. Res. 39(1) 71-78.
17. Laporte, G., Y. Norbert, D. Arpin. 1986. An exact algorithm for solving a capacitated location-routing problem. Ann. Oper. Res. 6(9) 293-310.
18. Laporte, G., Y. Norbert, S. Taillefer. 1988. Solving a family of multidepot vehicle routing and location-routing problems. Transportation Sci. 22(3) 161-172. (Pubitemid 18654114)
19. Lysgaard, J. 2003. CVRPSEP: A package of separation routines for the capacitated vehicle routing problem. Working Paper 03-04, Department of Management Science and Logistics, Aarhus School of Business, Aarhus, Denmark.
20. Min, H., V. Jayaraman, R. Srivastava. 1998. Combined location-routing problems: A synthesis and future research directions. Eur. J. Oper. Res. 108(1) 1-15. (Pubitemid 128372582)
21. Mirchandani, P., R. Francis, eds. 1990. Discrete Location Theory. Wiley, New York.
22. Nagy, G., S. Salhi. 2007. Location-routing: Issues, models and methods. Eur. J. Oper. Res. 177(2) 649-672. (Pubitemid 44647670)
23. Niskanen, S., P. R. J. Östergård. 2003. Cliquer user's guide. Technical Report 48, Helsinki University of Technology Communications Laboratory, Helsinki, Finland.
24. Prins, C., C. Prodhon, R. Wolfler Calvo. 2004. Nouveaux algorithmes pour le problème de localisation et routage sous contraintes de capacité. A. Dolgui, S. Dauzère-Pérès, eds. MOSIM'04, Vol. 2. Lavoisier, Ecole des Mines de Nantes, Nantes, France, 1115-1122.
25. Prins, C., C. Prodhon, R. Wolfler Calvo. 2006a. A memetic algorithm with population management (MA-PM) for the capacitated locationrouting problem. J. Gottlieb, G. R. Raidl, eds. Evolutionary Computation in Combinatorial Optimization. Lecture Notes in Computer Science, Vol. 3906. Springer, Heidelberg, Germany, 183-194. (Pubitemid 44019284)
26. Prins, C., C. Prodhon, R. Wolfler Calvo. 2006b. Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking. 4OR 4(3) 221-238.
27. Prins, C., C. Prodhon, A. Ruiz, P. Soriano, R. Wolfler Calvo. 2007. Solving the capacitated location-routing problem by a cooperative Lagrangean relaxation-granular tabu search heuristic. Transportation Sci. 41(4) 470-483.
28. Semet, F., E. Taillard. 1993. Solving real-life vehicle routing problems efficiently using tabu search. Ann. Oper. Res. 41(4) 469-488.
29. Srivastava, R. 1993. Alternate solution procedures for the location-routing problem. Omega Internat. J. Management Sci. 21(4) 497-506.
30. Tuzun, D., L. I. Burke. 1999. A two-phase tabu search approach to the location routing problem. Eur. J. Oper. Res. 116(1) 87-99.
31. Wasner, M., G. Zäpfel. 2004. An integrated multi-depot hub location vehicle routing model for network planning of parcel service. Internat. J. Production Econom. 90(3) 403-419.
32. Wu, T. H., C. Low, J. W. Bai. 2002. Heuristic solutions to multi-depot location-routing problems. Comput. Oper. Res. 29(10) 1393-1415. (Pubitemid 34409654)