nach oben

Erschienen in:

2015 | OriginalPaper | Buchkapitel

15. Location-Routing and Location-Arc Routing

verfasst von : Maria Albareda-Sambola

Erschienen in: Location Science

Verlag: Springer International Publishing

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config

KI-gestützte Suche

Aus

Abstract

This chapter overviews the most relevant contributions on location-routing problems. Although there exist many different models where location and routing decisions must be made in an integrated way, the chapter focuses on the so-called classical location-routing problems without entering into the details of other related problems that might be included in the location-routing area from a more general point of view. Reflecting the imbalance in the existing literature and available approaches, the case of problems with node routing is treated in detail throughout the chapter, while results concerning arc routing problems are concentrated in a single section.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

über 102.000 Bücher
über 537 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Finance + Banking
Management + Führung
Marketing + Vertrieb
Maschinenbau + Werkstoffe
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 390 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Maschinenbau + Werkstoffe

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 340 Zeitschriften

aus folgenden Fachgebieten:

Bauwesen + Immobilien
Business IT + Informatik
Finance + Banking
Management + Führung
Marketing + Vertrieb
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Vorheriges Kapitel Competitive Location Models

Nächstes Kapitel Location and Logistics

Ahn J, de Weck O, Geng Y, Klabjan D (2012) Column generation based heuristics for a generalized location routing problem with profits arising in space exploration. Eur J Oper Res 223:47–59CrossRef

Akca Z, Berger RT, Ralphs TK (2009) A branch-and-price algorithm for combined location and routing problems under capacity restrictions. In: Proceedings of the eleventh INFORMS computing society meeting, Charleston, pp 309–330

Albareda-Sambola M, Díaz JA, Fernández E (2005) A compact model and tight bounds for a combined location-routing problem. Comput Oper Res 32:407–428CrossRef

Amaya A, Langevin A, Trépanier M (2007) The capacitated arc routing problem with refill points. Oper Res Lett 35:45–53CrossRef

Amberg A, Domschke W, Voß S (2000) Multiple center capacitated arc routing problems: a tabu search algorithm using capacitated trees. Eur J Oper Res 2000:360–376CrossRef

Arbib C, Servilio M, Archetti C, Speranza MG (2014) The directed profitable location rural postman problem. Eur J Oper Res 236:811–819CrossRef

Baldacci R, Maniezzo B (2006) Exact methods based on node-routing formulations for undirected arc-routing problems. Networks 47:52–60CrossRef

Baldacci R, Mingozzi A, Wolfler Calvo R (2011) An exact method for the capacitated location-routing problem. Oper Res 59:1284–1296CrossRef

Barreto S, Ferreira C, Paixão J, Souza Santos B (2007) Using clustering analysis in a capacitated location-routing problem. Eur J Oper Res 179:968–977CrossRef

Bartolini E, Cordeau J-F, Laporte G (2013) Improved lower bounds and exact algorithm for the capacitated arc routing problem. Math Program 137:409–452CrossRef

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:931–941CrossRef

Berger RT, Coullard CR, Daskin MS (2007) Location-routing problems with distance constraints. Transp Sci 41:29–43CrossRef

Bode C, Irnich S (2012) Cut-first branch-and-price-second for the capacitated arc-routing problem. Oper Res 60:1167–1182CrossRef

Borges Lopes R, Ferreira C, Sousa Santos B, Barreto S (2013) A taxonomical analysis, current methods, and objectives on location-routing problems. Int T Oper Res 20:795–822

Borges Lopes R, Plastria F, Ferreira C, Sousa Santos B (2014) Location-arc routing problem: heuristic approaches and test instances. Comput Oper Res 43:309–317CrossRef

Contardo C, Cordeau J-F, Gendron B (2013) A computational comparison of flow formulations for the capacitated location-routing problem. Discret Optim 10:263–296CrossRef

Contardo C, Cordeau J-F, Gendron B (2014a) An exact algorithm based on cut-and-column generation for the capacitated location-routing problem. INFORMS J Comput 26:88–102CrossRef

Contardo C, Cordeau J-F, Gendron B (2014b) A GRASP+ILP-based metaheuristic for the capacitated location-routing problem. J Heuristics 20:1–38CrossRef

Desrochers M, Desrosiers J, Solomon MM (1992) A new optimization algorithm for the vehicle routing problem with time windows. Oper Res 40:342–354CrossRef

Doulabi SHH, Seifi A (2013) Lower and upper bounds for location-arc routing problems with vehicle capacity constraints. Eur J Oper Res 224:189–208CrossRef

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

Ghiani G, Laporte G (1998) Eulerian location problems. Networks 34:291–302CrossRef

Ghiani G, Laporte G (2001) Location-arc routing problems. OPSEARCH 38:151–159

Ghiani G, Improta G, Laporte G (2001) The capacitated arc routing problem with intermediate facilities. Networks 37:134–143CrossRef

Golden BL, Magnanti TL, Nguyen HQ (1977) Implementing vehicle routing algorithms. Networks 7:113–148CrossRef

Harks T, König FG, Matschuke J (2013) Approximation algorithms for capacitated location routing. Transp Sci 47:3–22CrossRef

Jarboui B, Houda D, Hanafi S, Mladenović N (2013) Variable neighborhood search for location routing. Comput Oper Res 40:47–57CrossRef

Laporte G (1988) Location-routing problems. In: Golden BL, Assad AA (eds) Vehicle routing: methods and studies. North-Holland, Amsterdam, pp 163–197

Laporte G, Nobert Y (1981) An exact algorithm for minimizing routing and operating costs in depot location. Eur J Oper Res 6:224–226CrossRef

Laporte G, Nobert Y, Pelletier P (1983) Hamiltonian location problems. Eur J Oper Res 12:82–89CrossRef

Laporte G, Nobert Y, Desrochers M (1985) Optimal routing under capacity and distance restrictions. Oper Res 33:1050–1073CrossRef

Laporte G, Nobert Y, Arpin D (1988) An exact algorithm for solving a capacitated location-routing problem. Ann Oper Res 6:293–310

Levy L, Bodin LD (1989) The arc oriented location routing problem. INFOR 27:74–94

Longo H, Aragão MP, Uchoa E (2006) Solving capacitated arc routing problems using a transformation to the CVRP. Comput Oper Res 33:1823–1837CrossRef

Manzour-al-Ajdad SMH, Torabi SA, Salhi S (2012) A hierarchical algorithm for the planar single-facility location routing problem. Comput Oper Res 39:461–470CrossRef

Maranzana F (1964) On the location of supply points to minimize transport costs. Oper Res Quart 15:261–270CrossRef

Nagy G, Salhi S (2007) Location-routing: issues, models and methods. Eur J Oper Res 177: 649–672CrossRef

Pearn WL, Assad AA, Golden BL (1987) Transforming arc routing into node routing problems. Comput Oper Res 14:285–288CrossRef

Perl J, Daskin MS (1985) A warehouse location-routing problem. Transp Res B-Meth 19:381–396CrossRef

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 ssearch heuristic. Transp Sci 41:470–483CrossRef

Prodhon C, Prins C (2014) A survey of recent research on location-routing problems. Eur J Oper Res 238:1–17CrossRef

Righini G, Salani M (2008) New dynamic programming algorithms for the resource constrained elementary shortest path problem. Networks 51:155–170CrossRef

Salazar-Aguilar MA, Langevin A, Laporte G (2013) The synchronized arc and node routing problem:application to road marking. Comput Oper Res 40:1708–1715CrossRef

Salhi S, Nagy G (2009) Local improvement in planar facility location using vehicle routing. Ann Oper Res 167:287–296CrossRef

Salhi S, Rand GK (1989) Effect of ignoring routes when locating depots. Eur J Oper Res 39: 150–156CrossRef

Samanlioglu F (2013) A multi-objective mathematical model for the industrial hazardous waste location-routing problem. Eur J Oper Res 226:332–340CrossRef

Schittekat P, Sörensen K (2009) Supporting “3PL” decisions in the automotive industry by generating diverse solutions to a large-scale location-routing problem. Oper Res 57:1058–1067CrossRef

Srivastava R, Benton WC (1990) The location-routing problem: considerations in physical distribution system design. Comput Oper Res 17:427–435CrossRef

Ting CJ, Chen CH (2013) A multiple ant colony optimization algorithm for the capacitated location routing problem. Int J Prod Econ 141:34–44CrossRef

Von Boventer E (1961) The relationship between transportation costs and location rent in transportation problems. J Reg Sci 3:27–40CrossRef

Willmer EJ, Linfati R, Toth P (2013) A two-phase hybrid heuristic algorithm for the capacitated location-routing problem. Comput Oper Res 40:70–79CrossRef

Yu VF, Lin SW, Lee W, Ting CJ (2010) A simulated annealing heuristic for the capacitated location routing problem. Comput Ind Eng 58:288–299CrossRef

Titel: Location-Routing and Location-Arc Routing
verfasst von: Maria Albareda-Sambola
Verlag: Springer International Publishing
Buch: Location Science
Print ISBN: 978-3-319-13110-8

Electronic ISBN: 978-3-319-13111-5

Copyright-Jahr: 2015
DOI: https://doi.org/10.1007/978-3-319-13111-5_15

Springer Professional

Abstract

Bitte loggen Sie sich ein, um Zugang zu Ihrer Lizenz zu erhalten.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Springer Professional "Technik"

Springer Professional "Wirtschaft"