Location-Routing and Location-Arc Routing

  • Maria Albareda-SambolaEmail author
  • Jessica Rodríguez-Pereira


This chapter overviews the most relevant contributions on location-routing problems. Although there exist several 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.


Discrete location-routing Mathematical programming Heuristics 


  1. 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–59MathSciNetzbMATHCrossRefGoogle Scholar
  2. 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–330Google Scholar
  3. al Ajdad SMHM, Torabi SA, Salhi S (2012) A hierarchical algorithm for the planar single-facility location routing problem. Eur J Oper Res 39:461–470Google Scholar
  4. 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–428MathSciNetzbMATHCrossRefGoogle Scholar
  5. Amaya A, Langevin A, Trépanier M (2007) The capacitated arc routing problem with refill points. Oper Res Lett 35:45–53MathSciNetzbMATHCrossRefGoogle Scholar
  6. 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–376zbMATHCrossRefGoogle Scholar
  7. Arbib C, Servilio M, Archetti C, Speranza MG (2014) The directed profitable location rural postman problem. Eur J Oper Res 236:811–819MathSciNetzbMATHCrossRefGoogle Scholar
  8. Baldacci R, Maniezzo B (2006) Exact methods based on node-routing formulations for undirected arc-routing problems. Networks 47:52–60MathSciNetzbMATHCrossRefGoogle Scholar
  9. Baldacci R, Mingozzi A, Wolfler Calvo R (2011) An exact method for the capacitated location-routing problem. Oper Res 59:1284–1296MathSciNetzbMATHCrossRefGoogle Scholar
  10. 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–977zbMATHCrossRefGoogle Scholar
  11. Bartolini E, Cordeau J-F, Laporte G (2013) Improved lower bounds and exact algorithm for the capacitated arc routing problem. Math Program 137:409–452MathSciNetzbMATHCrossRefGoogle Scholar
  12. 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–941MathSciNetzbMATHCrossRefGoogle Scholar
  13. Berger RT, Coullard CR, Daskin MS (2007) Location-routing problems with distance constraints. Transport Sci 41:29–43CrossRefGoogle Scholar
  14. Bode C, Irnich S (2012) Cut-first branch-and-price-second for the capacitated arc-routing problem. Oper Res 60:1167–1182MathSciNetzbMATHCrossRefGoogle Scholar
  15. 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–822MathSciNetzbMATHGoogle Scholar
  16. 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–317MathSciNetzbMATHCrossRefGoogle Scholar
  17. Caunhye A, Zhang Y, Li M, Nie X (2016) A location-routing model for prepositioning and distributing emergency supplies. Transport Res E-Log 90:161–176CrossRefGoogle Scholar
  18. Contardo C, Cordeau J-F, Gendron B (2013) A computational comparison of flow formulations for the capacitated location-routing problem. Discrete Optim 10:263–296MathSciNetzbMATHCrossRefGoogle Scholar
  19. 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–102MathSciNetzbMATHCrossRefGoogle Scholar
  20. Contardo C, Cordeau J-F, Gendron B (2014b) A GRASP +  ILP-based metaheuristic for the capacitated location-routing problem. J Heuristics 20:1–38zbMATHCrossRefGoogle Scholar
  21. Desrochers M, Desrosiers J, Solomon MM (1992) A new optimization algorithm for the vehicle routing problem with time windows. Oper Res 40:342–354MathSciNetzbMATHCrossRefGoogle Scholar
  22. Doulabi SHH, Seifi A (2013) Lower and upper bounds for location-arc routing problems with vehicle capacity constraints. Eur J Oper Res 224:189–208MathSciNetzbMATHCrossRefGoogle Scholar
  23. Drexl M, Schneider M (2015) A survey of variants and extensions of the location-routing problem. Eur J Oper Res 241:283–308MathSciNetzbMATHCrossRefGoogle Scholar
  24. Escobar JW, Linfati R, Toth P (2013) A two-phase hybrid heuristic algorithm for the capacitated location-routing problem. Comput Oper Res 40:70–79MathSciNetzbMATHCrossRefGoogle Scholar
  25. Escobar JW, Linfati R, Baldoquin MG, Toth P (2014) A granular variable tabu neighborhood search for the capacitated location-routing problem. Transp Res B Methodol 67:344–356CrossRefGoogle Scholar
  26. Farham MS, Süral H, Iyigun C (2018) A column generation approach for the location-routing problem with time windows. Comput Oper Res 90:249–263MathSciNetzbMATHCrossRefGoogle Scholar
  27. Feillet D, Gendreau M, Rousseau L-M (2007) New refinements for the solution of vehicle routing problems with branch and price. INFOR 45:239–256MathSciNetGoogle Scholar
  28. Fernández E, Laporte G, Rodríguez-Pereira J (2019) Exact solution of several families of location-arc routing problems. Transp Sci 53:1213–1499CrossRefGoogle Scholar
  29. Ferreira K, de Queiroz T (2018) Two effective simulated annealing algorithms for the location-routing problem. Appl Soft Comput 70:389–422CrossRefGoogle Scholar
  30. Ghiani G, Laporte G (1998) Eulerian location problems. Networks 34:291–302MathSciNetzbMATHCrossRefGoogle Scholar
  31. Ghiani G, Laporte G (2001) Location-arc routing problems. OPSEARCH 38:151–159CrossRefGoogle Scholar
  32. Ghiani G, Improta G, Laporte G (2001) The capacitated arc routing problem with intermediate facilities. Networks 37:134–143MathSciNetzbMATHCrossRefGoogle Scholar
  33. Golden BL, Magnanti TL, Nguyen HQ (1977) Implementing vehicle routing algorithms. Networks 7:113–148zbMATHCrossRefGoogle Scholar
  34. Harks T, König FG, Matschuke J (2013) Approximation algorithms for capacitated location routing. Transport Sci 47:3–22CrossRefGoogle Scholar
  35. Jarboui B, Houda D, Hanafi S, Mladenović N (2013) Variable neighborhood search for location routing. Comput Oper Res 40:47–57MathSciNetzbMATHCrossRefGoogle Scholar
  36. Koç Ç, Bektaş T, Jabali O, Laporte G (2016) The fleet size and mix location-routing problem with time windows: Formulations and a heuristic algorithm. Eur J Oper Res 248:33–51MathSciNetzbMATHCrossRefGoogle Scholar
  37. Koç Ç, Bektaş T, Jabali O, Laporte G (2016) The impact of depot location, fleet composition and routing on emissions in city logistics. Transp Res B Methodol 84:81–102CrossRefGoogle Scholar
  38. Laporte G (1988) Location-routing problems. In: Golden BL, Assad AA (eds) Vehicle routing: methods and studies. North-Holland, Amsterdam, pp 163–197Google Scholar
  39. Laporte G, Nobert Y (1981) An exact algorithm for minimizing routing and operating costs in depot location. Eur J Oper Res 6:224–226zbMATHCrossRefGoogle Scholar
  40. Laporte G, Nobert Y, Pelletier P (1983) Hamiltonian location problems. Eur J Oper Res 12:82–89zbMATHCrossRefGoogle Scholar
  41. Laporte G, Nobert Y, Desrochers M (1985) Optimal routing under capacity and distance restrictions. Oper Res 33:1050–1073MathSciNetzbMATHCrossRefGoogle Scholar
  42. Laporte G, Nobert Y, Arpin D (1988) An exact algorithm for solving a capacitated location-routing problem. Ann Oper Res 6:293–310Google Scholar
  43. Levy L, Bodin LD (1989) The arc oriented location routing problem. INFOR 27:74–94Google Scholar
  44. Longo H, Aragão MP, Uchoa E (2006) Solving capacitated arc routing problems using a transformation to the CVRP. Comput Oper Res 33:1823–1837zbMATHCrossRefGoogle Scholar
  45. Maranzana F (1964) On the location of supply points to minimize transport costs. Oper Res Quart 15:261–270CrossRefGoogle Scholar
  46. Nagy G, Salhi S (2007) Location-routing: issues, models and methods. Eur J Oper Res 177:649–672MathSciNetzbMATHCrossRefGoogle Scholar
  47. Pearn WL, Assad AA, Golden BL (1987) Transforming arc routing into node routing problems. Comput Oper Res 14:285–288zbMATHCrossRefGoogle Scholar
  48. Perl J, Daskin MS (1985) A warehouse location-routing problem. Transp Res B Methodol 19:381–396CrossRefGoogle Scholar
  49. 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. Transport Sci 41:470–483CrossRefGoogle Scholar
  50. Prodhon C, Prins C (2014) A survey of recent research on location-routing problems. Eur J Oper Res 238:1–17MathSciNetzbMATHCrossRefGoogle Scholar
  51. Righini G, Salani M (2008) New dynamic programming algorithms for the resource constrained elementary shortest path problem. Networks 51:155–170MathSciNetzbMATHCrossRefGoogle Scholar
  52. Riquelme-Rodríguez JP, Gamache M, Langevin A (2016) Location arc routing problem with inventory constraints. Comput Oper Res 76:84–94MathSciNetzbMATHCrossRefGoogle Scholar
  53. Rodríguez-Pereira J (2017) New models and algorithms for several families of arc routing problems. Ph.D. Thesis, Statistics and Operations Research Department. Technical University of Catalunya,
  54. Salazar-Aguilar MA, Langevin A, Laporte G (2013) The synchronized arc and node routing problem:application to road marking. Comput Oper Res 40:1708–1715zbMATHCrossRefGoogle Scholar
  55. Salhi S, Rand GK (1989) Effect of ignoring routes when locating depots. Eur J Oper Res 39:150–156MathSciNetzbMATHCrossRefGoogle Scholar
  56. Salhi S, Nagy G (2009) Local improvement in planar facility location using vehicle routing. Ann Oper Res 167:287–296MathSciNetzbMATHCrossRefGoogle Scholar
  57. Samanlioglu F (2013) A multi-objective mathematical model for the industrial hazardous waste location-routing problem. Eur J Oper Res 226:332–340MathSciNetzbMATHCrossRefGoogle Scholar
  58. 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–1067CrossRefGoogle Scholar
  59. Srivastava R, Benton WC (1990) The location-routing problem: considerations in physical distribution system design. Comput Oper Res 17:427–435CrossRefGoogle Scholar
  60. Ting CJ, Chen CH (2013) A multiple ant colony optimization algorithm for the capacitated location routing problem. Int J Prod Econ 141:34–44CrossRefGoogle Scholar
  61. Von Boventer E (1961) The relationship between transportation costs and location rent in transportation problems. J Reg Sci 3:27–40CrossRefGoogle Scholar
  62. Yu VF, Lin SW, Lee W, Ting CJ (2010) A simulated annealing heuristic for the capacitated location routing problem. Comput Ind Eng 58:288–299CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  • Maria Albareda-Sambola
    • 1
    Email author
  • Jessica Rodríguez-Pereira
    • 2
  1. 1.Universitat Politècnica de CatalunyaBarcelonaTechBarcelonaSpain
  2. 2.HEC MontréalMontréalCanada

Personalised recommendations