The Multicommodity-Ring Location Routing Problem

References

• Akça Z, Berger RT, Ralphs TK (2009) A branch-and-price algorithm for combined location and routing problems under capacity restrictions. Chinneck JW, Kristjansson B, Saltzman MJ, eds. Operations Research and Cyber-Infrastructure, Oper. Res./Comput. Sci. Interfaces, Vol. 47 (Springer, New York), 309–330.Crossref, Google Scholar
• Aksen D, Altinkemer K (2008) A location-routing problem for the conversion to the “click-and-mortar” retailing: The static case. Eur. J. Oper. Res. 186(2):554–575.Crossref, Google Scholar
• Amaya A, Langevin A, Trépanier M (2007) The capacitated arc routing problem with refill points. Oper. Res. Lett. 35(1):45–53.Crossref, Google Scholar
• Ambrosino D, Scutellà MG (2001) Distribution network design: New problems and related models. Eur. J. Oper. Res. 165(3):610–624.Crossref, Google Scholar
• Applegate D, Bixby RE, Chvátal V, Cook W (2006) Concorde TSP solver. http://www.tsp.gatech.edu/concorde.html.Google Scholar
• Ausiello G, Bonifaci V, Leonardi S, Marchetti-Spaccamela A (2007) Prize collecting traveling salesman and related problems. Gonzales T, ed. Handbook of Approximation Algorithms and Metaheuristics (CRC Press, Boca Raton, FL), 40.1–40.13.Google Scholar
• Baldacci R, Mingozzi A, Wolfler Calvo R (2011) An exact method for the capacitated location-routing problem. Oper. Res. 59(5): 1284–1296.Link, Google Scholar
• Barreto SS, Ferreira C, Paixão J, Sousa Santos B (2007) Using clustering analysis in a capacitated location-routing problem. Eur. J. Oper. Res. 179(3):968–977.Crossref, Google Scholar
• Belenguer JM, Benavent E, Prins C, Prodhon C, Wolfler Calvo R (2011) A branch-and-cut method for the capacitated location-routing problem. Comput. Oper. Res. 38(6):931–941.Crossref, Google Scholar
• Berger RT (1997) Location-Routing Models for Distribution System Design (Northwestern University, Evanston, IL).Crossref, Google Scholar
• Berger RT, Coullard CR, Daskin MS (2007) Location-routing problems with distance constraints. Transportation Sci. 41(1):29–43.Link, Google Scholar
• Boccia M, Crainic TG, Sforza A, Sterle C (2010) A metaheuristic for a two echelon location-routing problem. Experimental Algorithms, Lecture Notes Comput. Sci., Vol. 6049 (Springer, Berlin Heidelberg), 288–301.Crossref, Google Scholar
• Boccia M, Crainic TG, Sforza A, Sterle C (2011) Location-routing models for designing a two-echelon freight distribution system. Technical report 06, CIRRELT, Université de Montréal, Montréal.Google Scholar
• Burke LI, Tuzun D (1999) A two-phase tabu search approach to the location routing problem. Eur. J. Oper. Res. 116(1):87–99.Crossref, Google Scholar
• Contardo C, Cordeau JF, Gendron B (2014a) An exact algorithm based on cut-and-column generation for the capacitated location-routing problem. INFORMS J. Comput. 26(1):88–102.Link, Google Scholar
• Contardo C, Cordeau JF, Gendron B (2014b) A GRASP + ILP-based metaheuristic for the capacitated location-routing problem. J. Heuristics 20(1):1–38.Crossref, Google Scholar
• Contardo C, Hemmelmayr VC, Crainic TG (2012) Lower and upper bounds for the two-echelon capacitated location-routing problem. Comput. OR 39(12):3185–3199.Crossref, Google Scholar
• Del Pia A, Filippi C (2006) A variable neighborhood descent algorithm for a real waste collection problem with mobile depots. Internat. Trans. Oper. Res. 13(2):125–141.Crossref, Google Scholar
• Derbel H, Jarboui B, Hanafi S, Chabchoub H (2010) An iterated local search for solving a location-routing problem. Electronic Notes Discrete Math. 36:875–882.Crossref, Google Scholar
• Escobar JW, Linfati R, Toth P (2013) A two-phase hybrid heuristic algorithm for the capacitated location-routing problem. Comput. Oper. Res. 40(1):70–79.Crossref, Google Scholar
• Fischetti M, Salazar Gonzalez JJ, Toth P (1997) A branch-and-cut algorithm for the symmetric generalized traveling salesman problem. Oper. Res. 45(3):378–394.Link, Google Scholar
• Guerrero WJ, Prodhon C, Velasco N, Amaya CA (2013) Hybrid heuristic for the inventory location-routing problem with deterministic demand. Internat. J. Production Econom. 146(1): 359–370.Crossref, Google Scholar
• Jarboui B, Derbel H, Hanafi S, Mladenović N (2013) Variable neighborhood search for location routing. Comput. Oper. Res. 40(1): 47–57.Crossref, Google Scholar
• Karaoglan I, Altiparmak F, Kara I, Dengiz B (2012) The location-routing problem with simultaneous pickup and delivery: Formulations and a heuristic approach. Omega 40(4):465–477.Crossref, Google Scholar
• Laporte G (1986) Generalized subtour elimination constraints and connectivity constraints. J. Oper. Res. Soc. 37(5):509–514.Crossref, Google Scholar
• Laporte G (1988) Location-routing problems. Golden B, Assad A, eds. Vehicle Routing: Methods and Studies (North Holland, Amsterdam), 163–196.Google Scholar
• Laporte G (1989) A survey of algorithms for location-routing problems. Investigación Operativa 1(2):93–123.Google Scholar
• Laporte G, Nobert Y (1981) An exact algorithm for minimizing routing and operating costs in depot location. Eur. J. Oper. Res. 6(2):224–226.Crossref, Google Scholar
• Laporte G, Nobert Y, Arpin D (1986) An exact algorithm for solving a capacitated location-routing problem. Ann. Oper. Res. 6(9):291–310.Crossref, Google Scholar
• Letchford AN, Nasiri SD, Theis DO (2013) Compact formulations of the Steiner traveling salesman problem and related problems. Eur. J. Oper. Res. 228(1):83–92.Crossref, Google Scholar
• Lin CKY, Chow CK, Chen A (2002) A location-routing-loading problem for bill delivery services. Comput. Ind. Eng. 43(1–2): 5–25.Crossref, Google Scholar
• Lin JR, Lei HC (2009) Distribution systems design with two-level routing considerations. Ann. Oper. Res. 172(1):329–347.Crossref, Google Scholar
• Lin S, Kernighan BW (1973) An effective heuristic algorithm for the traveling-salesman problem. Oper. Res. 21(2):498–516.Link, Google Scholar
• Liu SC, Lee SB (2003) A two-phase heuristic method for the multi-depot location routing problem taking inventory control decisions into consideration. Internat. J. Advanced Manufacturing Tech. 22(11–12):941–950.Crossref, Google Scholar
• Min H (1996) Consolidation terminal location-allocation and consolidated routing problems. J. Bus. Logist. 17(2):235–263.Google Scholar
• Min H, Jayaraman V, Srivastava R (1998) Combined location-routing problems: A synthesis and future research directions. Eur. J. Oper. Res. 108(1):1–15.Crossref, Google Scholar
• Nagy G, Salhi S (1998) The many-to-many location-routing problem. TOP: An Official J. Spanish Soc. Statist. Oper. Res. 6(2):261–275.Google Scholar
• Nagy G, Salhi S (2007) Location-routing: Issues, models and methods. Eur. J. Oper. Res. 177(2):649–672.Crossref, Google Scholar
• Nemhauser GL, Savelsbergh MWP, Linderoth JT (2005) Functional description of MINTO, a Mixed INTeger Optimizer, Version 3.1. Technical report, Georgia Institute of Technology, Atlanta.Google Scholar
• Nguyen VP, Prins C, Prodhon C (2012a) A multi-start iterated local search with tabu list and path relinking for the two-echelon location-routing problem. Engrg. Appl. Artificial Intelligence 25(1):56–71.Crossref, Google Scholar
• Nguyen VP, Prins C, Prodhon C (2012b) Solving the two-echelon location routing problem by a GRASP reinforced by a learning process and path relinking. Eur. J. Oper. Res. 216(1):113–126.Crossref, Google Scholar
• Perl J, Daskin MS (1985) A warehouse location routing model. Transportation Res. Part B 19(5):381–396.Crossref, Google Scholar
• Prins C, Prodhon C, Wolfler Calvo R (2006) Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking. 4OR 4(3):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(4):470–483.Link, Google Scholar
• Prodhon C, Prins C (2008) A memetic algorithm with population management (MA|PM) for the periodic location-routing problem. Blesa MJ, Blum C, Cotta C, Fernández AJ, Gallardo JE, Roli A, Sampels M, eds. Hybrid Metaheuristics, Lecture Notes Comput. Sci., Vol. 5296 (Springer, Berlin Heidelberg), 43–57.Google Scholar
• Prodhon C, Prins C (2014) A survey of recent research on location-routing problems. Eur. J. Oper. Res. 238(1):1–17.Crossref, Google Scholar
• Rath S, Gutjahr WJ (2014) A math-heuristic for the warehouse location-routing problem in disaster relief. Comput. Oper. Res. 42:25–39.Crossref, Google Scholar
• Schwengerer M, Pirkwieser S, Raidl GR (2012) A variable neighborhood search approach for the two-echelon location-routing problem. Hao J-K, Middendorf M, eds. Evolutionary Computation in Combinatorial Optimization, Lecture Notes Comput. Sci., Vol. 7245 (Springer, Berlin Heidelberg), 13–24.Crossref, Google Scholar
• Singh RD (1998) Location-routing problems. Ph.D. thesis, Pennsylvania State University, University Park, PA.Google Scholar