Location-arc routing problem: Heuristic approaches and test instances

Computers and Operations Research

Volumn 43, Issue , 2014, Pages 309-317

  Lopes, Rui Borges ^a   Plastria, Frank ^b   Ferreira, Carlos ^a   Santos, Beatriz Sousa ^c  

^a UNIVERSITY OF AVEIRO   (Portugal)

^b VRIJE UNIVERSITEIT BRUSSEL   (Belgium)

^c UNIVERSITY OF AVEIRO   (Portugal)

Author keywords

Arc routing; Heuristics; Location routing; Test instances

Indexed keywords

ARC ROUTING; CAPACITATED ARC ROUTING PROBLEM; GARBAGE COLLECTION; HEURISTIC APPROACH; HEURISTICS; IMPROVEMENT METHODS; LOCATION-ROUTING; TEST INSTANCES;

BENCHMARKING; HEURISTIC METHODS;

NETWORK ROUTING;

EID: 84887109658     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2013.10.003     Document Type: Article

References (36)

1. G. Nagy, and S. Salhi Location-routing: issues, models and methods Eur J Oper Res 177 2 2007 649 672 (Pubitemid 44647670)
2. R.B. Lopes, C. Ferreira, B.S. Santos, and S. Barreto A taxonomical analysis, current methods and objectives on location-routing problems Intl Trans Oper Res 20 6 2013 795 822 10.1111/itor.12032
3. G. Ghiani, and G. Laporte Location-arc routing problems Opsearch 38 2 2001 151 159
4. B.L. Golden, and R.T. Wong Capacitated arc routing problems Networks 11 3 1981 305 315
5. W.L. Pearn, A. Assad, and B.L. Golden Transforming arc routing into node routing problems Comput Oper Res 14 4 1987 285 288 (Pubitemid 17621256)
6. R. Baldacci, and V. Maniezzo Exact methods based on node-routing formulations for undirected arc-routing problems Networks 47 1 2006 52 60
7. H. Longo, M.Pd. Aragão, and E. Uchoa Solving capacitated arc routing problems using a transformation to the CVRP Comput Oper Res 33 6 2006 1823 1837 (Pubitemid 41525712)
8. S. Wøhlk A decade of capacitated arc routing B.L. Golden, S. Raghavan, E. Wasil, The vehicle routing problem: latest advances and new challenges 2008 Springer New York 29 48
9. L. Levy, and L. Bodin The arc oriented location routing problem INFOR 27 1 1989 74 94
10. G. Laporte Location-routing problems B.L. Golden, A.A. Assad, Vehicle routing: methods and studies 1988 North-Holland Amsterdam 163 198
11. G. Ghiani, and G. Laporte Eulerian location problems Networks 34 4 1999 291 302 (Pubitemid 129318855)
12. Muyldermans L. Routing, districting and location for arc traversal problems [Ph.D. thesis]. Leuven: Katholieke Universiteit Leuven; 2003.
13. A.D. Pia, and C. Filippi A variable neighborhood descent algorithm for a real waste collection problem with mobile depots Intl Trans Oper Res 13 2 2006 125 141 (Pubitemid 43405835)
14. A. Amaya, A. Langevin, and M. Trépanier The capacitated arc routing problem with refill points Oper Res Lett 35 1 2007 45 53 (Pubitemid 44802771)
15. P.B. Mirchandani, and R.L. Francis Discrete location theory 1990 Wiley New York
16. A. Hertz, and M. Widmer Guidelines for the use of meta-heuristics in combinatorial optimization Eur J Oper Res 151 2 2003 247 252
17. G. Clarke, and J. Wright Scheduling of vehicles from a central depot to a number of delivery points Oper Res 12 4 1964 568 581
18. J.M. Belenguer, E. Benavent, P. Lacomme, and C. Prins Lower and upper bounds for the mixed capacitated arc routing problem Comput Oper Res 33 12 2006 3363 3383
19. C. Prins, C. Prodhon, and R. Wolfler Calvo Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking 4OR 4 3 2006 221 238
20. P. Beullens, L. Muyldermans, D. Cattrysse, and D. Van Oudheusden A guided local search heuristic for the capacitated arc routing problem Eur J Oper Res 147 3 2003 629 643
21. S. Lin, and B.W. Kernighan An effective heuristic algorithm for the traveling salesman problem Oper Res 21 2 1973 498 516
22. M. Savelsbergh The vehicle routing problem with time windows: minimizing route duration INFORMS J Comput 4 2 1992 146 154
23. F.W. Glover, and G.A. Kochenberger Handbook of metaheuristics 2003 Kluwer Academic Publishers Norwell
24. E.G. Talbi Metaheuristics: from design to implementation 2009 Wiley Hoboken
25. N. Mladenović, and P. Hansen Variable neighborhood search Comput Oper Res 24 11 1997 1097 1100
26. P. Hansen, and N. Mladenović Variable neighborhood search: principles and applications Eur J Oper Res 130 3 2001 449 467 (Pubitemid 32875304)
27. M. Polacek, K.F. Doerner, R.F. Hartl, and V. Maniezzo A variable neighborhood search for the capacitated arc routing problem with intermediate facilities J Heuristics 14 5 2008 405 423
28. É. Taillard, P. Badeau, M. Gendreau, F. Guertin, and J.Y. Potvin A tabu search heuristic for the vehicle routing problem with soft time windows Transp Sci 31 2 1997 170 186 (Pubitemid 127597092)
29. V.J.M.F. Filho, and R.D. Galvão A tabu search heuristic for the concentrator location problem Locat Sci 6 1 1998 189 209
30. F. Glover Future paths for integer programming and links to artificial intelligence Comput Oper Res 13 5 1986 533 549 (Pubitemid 17480188)
31. S. Barreto, C. Ferreira, J. Paixão, and B.S. Santos Using clustering analysis in a capacitated location-routing problem Eur J Oper Res 179 3 2007 968 977 (Pubitemid 46038597)
32. M.G.C. Resende, and C.C. Ribeiro Greedy randomized adaptive search procedures F.W. Glover, G.A. Kochenberger, Handbook of metaheuristics 2003 Kluwer Academic Publishers Norwell 219 249
33. E.W. Dijkstra A note on two problems in connexion with graphs Numerische Math 1 1 1959 269 271
34. B.L. Golden, J.S. DeArmon, and E.K. Baker Computational experiments with algorithms for a class of routing problems Comput Oper Res 10 1 1983 47 59 (Pubitemid 13493950)
35. E. Benavent, V. Campos, Á. Corberán, and E. Mota The capacitated chinese postman problem: lower bounds Networks 22 7 1992 669 690
36. R.W. Eglese Routeing winter gritting vehicles Discrete Appl Math 48 3 1994 231 244