An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem

References

• Akca Z, Berger RT, Ralphs TK (2009) Modeling and solving location, routing, and scheduling problems. Chinneck JW, ed. Proc. Eleventh INFORMS Comput. Soc. Meeting (Charleston, SC), 309–330.Google Scholar
• Archetti C, Bouchard M, Desaulniers G (2011) Enhanced branch and price and cut for vehicle routing with split deliveries and time windows. Transportation Sci. 45:285–298.Link, Google Scholar
• Augerat P (1995) Approche polyhédrale du problème de tournées de véhicules. Ph.D. thesis, Institut National Polytechnique de Grenoble, France.Google Scholar
• Balas E, Padberg MW (1976) Set-partitioning: A survey. SIAM Rev. 18:710–760.Crossref, Google Scholar
• Baldacci R, Christofides N, Mingozzi A (2008) An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts. Math. Programming 115:351–385.Crossref, Google Scholar
• Baldacci R, Mingozzi A, Wolfler Calvo R (2011) An exact method for the capacitated location-routing problem. Oper. Res. 59:1284–1296.Link, Google Scholar
• Baldacci R, Bartolini E, Mingozzi A, Roberti R (2010) An exact solution framework for a broad class of vehicle routing problems. Comput. Management Sci. 7:229–268.Crossref, Google Scholar
• Barreto S (2004) Análise e modelização de problemas de localização-distribuição. Ph.D. thesis, University of Aveiro, Campus Universitário de Santiago, Aveiro, Portugal.Google Scholar
• Belenguer JM, Benavent E, Prins C, Prodhon C, Wolfler Calvo R (2011) A branch-and-cut algorithm for the capacitated location routing problem. Comput. Oper. Res. 38:931–941.Crossref, Google Scholar
• Billionet A, Elloumi S, Djerbi LG (2005) Designing radio-mobile access networks based on synchronous digital hierarchy rings. Comput. Oper. Res. 32:379–394.Crossref, Google Scholar
• Boland B, Dethridge J, Dumitrescu I (2006) Accelerated label setting algorithms for the elementary resource constrained shortest path problem. Oper. Res. Lett. 34:58–68.Crossref, Google Scholar
• Christofides N, Mingozzi A, Toth P (1981) Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations. Math. Programming 20:255–282.Crossref, Google Scholar
• Contardo C, Cordeau J-F, Gendron B (2011) A computational comparison of flow formulations for the capacitated location-routing problem. Technical report CIRRELT-2011-47, Université de Montréal, Canada.Google Scholar
• Desaulniers G, Lessard F, Hadjar A (2008) Tabu search, partial elementarity, and generalized k-path inequalities for the vehicle routing problem with time windows. Transportation Sci. 42:387–404.Link, Google Scholar
• Desrochers M, Desrosiers J, Solomon M (1992) A new optimization algorithm for the vehicle routing problem with time windows. Oper. Res. 40:342–354.Link, Google Scholar
• du Merle O, Villeneuve D, Desrosiers J, Hansen P (1999) Stabilized column generation. Discrete Math. 194:229–237.Crossref, Google Scholar
• Feillet D, Gendreau M, Rousseau L-M (2007) New refinements for the solution of vehicle routing problems with branch and price. INFOR 45:239–256.Google Scholar
• Fukasawa R, Longo H, Lysgaard J, Poggi de Aragão M, Reis M, Uchoa E, Werneck RF (2006) Robust branch-and-cut-and-price for the capacitated vehicle routing problem. Math. Programming Ser. A 106:491–511.Crossref, Google Scholar
• Gunnarsson H, Rönnqvist M, Carlsson D (2006) A combined terminal location and ship routing problem. J. Oper. Res. Soc. 57:928–938.Crossref, Google Scholar
• Hansen PH, Hegedahl B, Hjortkjaer S, Obel B (1994) A heuristic solution to the warehouse location-routing problem. Eur. J. Oper. Res. 76:111–127.Crossref, Google Scholar
• Jepsen M, Petersen B, Spoorendonk S, Pisinger D (2008) Subset-row inequalities applied to the vehicle-routing problem with time windows. Oper. Res. 56:497–511.Link, Google Scholar
• Labbé M, Laporte G (1986) Maximizing user convenience and postal service efficiency in post box location. Belgian J. Oper. Res., Statist. Comput. Sci. 26:21–35.Google Scholar
• Lin CKY, Chow CK, Chen A (2002) A location-routing-loading problem for bill delivery services. Comput. Oper. Res. 43:5–25.Google Scholar
• Liu SC, Lin CC (2005) A heuristic method for the combined location routing and inventory problem. Internat. J. Advanced Manufacturing Tech. 26:372–381.Crossref, Google Scholar
• Lysgaard J, Letchford AN, Eglese RW (2004) A new branch-and-cut algorithm for the capacitated vehicle routing problem. Math. Programming 100:423–445.Crossref, Google Scholar
• Perl J, Daskin MS (1985) A warehouse location-routing problem. Transportation Res. B 19:381–396.Crossref, Google Scholar
• Prins C, Prodhon C, Wolfler Calvo R (2006a) A memetic algorithm with population management (MA ∣ PM) for the capacitated location-routing problem. Gottlieb J, Raidl GR, eds. EvoCOP 2006, Lecture Notes in Computer Science, Vol. 3906 (Springer-Verlag, Berlin), 183–194.Crossref, Google Scholar
• Prins C, Prodhon C, Wolfler Calvo R (2006b) Solving the capacitated location-routing problem by a GRASP complemented by a learning process and path relinking. 4OR 4:221–238.Crossref, Google Scholar
• Prins C, Prodhon C, Ruiz A, Soriano P, Wolfler Calvo R (2007) Solving the capacitated location-routing problem by a cooperative Lagrangean relaxation-granular tabu search heuristic. Transportation Sci. 41:470–483.Link, Google Scholar
• Righini G, Salani M (2008) New dynamic programming algorithms for the resource constrained elementary shortest path problem. Networks 51:155–170.Crossref, Google Scholar
• Tuzun D, Burke LI (1999) A two-phase tabu search approach to the location routing problem. Eur. J. Oper. Res. 116:87–99.Crossref, Google Scholar
• Wu T-H, Low C, Bai J-W (2002) Heuristic solutions to multi-depot location-routing problems. Comput. Oper. Res. 29:1393–1415.Crossref, Google Scholar