Geoscience Reference
In-Depth Information
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
Berger RT, Coullard CR, Daskin MS (2007) Location-routing problems with distance constraints.
Transp Sci 41:29-43
Bode C, Irnich S (2012) Cut-first branch-and-price-second for the capacitated arc-routing problem.
Oper Res 60:1167-1182
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-317
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
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
Contardo C, Cordeau J-F, Gendron B (2014b) A GRASPCILP-based metaheuristic for the
capacitated location-routing problem. J Heuristics 20:1-38
Desrochers M, Desrosiers J, Solomon MM (1992) A new optimization algorithm for the vehicle
routing problem with time windows. Oper Res 40:342-354
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
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-302
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-143
Golden BL, Magnanti TL, Nguyen HQ (1977) Implementing vehicle routing algorithms. Networks
7:113-148
Harks T, König FG, Matschuke J (2013) Approximation algorithms for capacitated location
routing. Transp Sci 47:3-22
Jarboui B, Houda D, Hanafi S, Mladenovic N (2013) Variable neighborhood search for location
routing. Comput Oper Res 40:47-57
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-226
Laporte G, Nobert Y, Pelletier P (1983) Hamiltonian location problems. Eur J Oper Res 12:82-89
Laporte G, Nobert Y, Desrochers M (1985) Optimal routing under capacity and distance restric-
tions. Oper Res 33:1050-1073
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-1837
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
Maranzana F (1964) On the location of supply points to minimize transport costs. Oper Res Quart
15:261-270
Nagy G, Salhi S (2007) Location-routing: issues, models and methods. Eur J Oper Res 177:
649-672
Pearn WL, Assad AA, Golden BL (1987) Transforming arc routing into node routing problems.
Comput Oper Res 14:285-288
Perl J, Daskin MS (1985) A warehouse location-routing problem. Transp Res B-Meth 19:381-396
