Skip to main content
SpringerLink
Log in

Location-Routing and Location-Arc Routing

  • Chapter
  • First Online:
Location Science

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 89.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 119.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  • 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–59

    Article  Google Scholar 

  • 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

    Google Scholar 

  • 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–428

    Article  Google Scholar 

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

    Article  Google Scholar 

  • 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–376

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

  • 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–977

    Article  Google Scholar 

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

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

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

  • 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

    Google Scholar 

  • 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–317

    Article  Google Scholar 

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

    Article  Google Scholar 

  • 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–102

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Article  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 

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

    Article  Google Scholar 

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

    Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Article  Google Scholar 

  • 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–470

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

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

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

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

  • 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–1067

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Universitat Politècnica de Catalunya, BarcelonaTech, Barcelona, Spain

    Maria Albareda-Sambola

Authors
  1. Maria Albareda-Sambola
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Maria Albareda-Sambola .

Editor information

Editors and Affiliations

  1. HEC Montréal, Montréal, Canada

    Gilbert Laporte

  2. Institute of Operations Research (IOR), Karlsruhe Institute of Technology, Karlsruhe, Germany

    Stefan Nickel

  3. DEIO-FCUL, University of Lisbon, Lisbon, Portugal

    Francisco Saldanha da Gama

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Albareda-Sambola, M. (2015). Location-Routing and Location-Arc Routing. In: Laporte, G., Nickel, S., Saldanha da Gama, F. (eds) Location Science. Springer, Cham. https://doi.org/10.1007/978-3-319-13111-5_15

Download citation

Publish with us

Policies and ethics

Search

Navigation