GRASP with evolutionary path-relinking for the capacitated arc routing problem

Computers and Operations Research

Volumn 40, Issue 12, 2013, Pages 3206-3217

  Luiz Usberti, Fábio ^a   Morelato França, Paulo ^b   França, André Luiz Morelato ^a  

^a UNIVERSITY OF CAMPINAS   (Brazil)

^b SÃO PAULO STATE UNIVERSITY UNESP   (Brazil)

Author keywords

Arc routing; Evolutionary path relinking; GRASP filtering; Infeasible solution space search; Metaheuristics; Reactive parameters

Indexed keywords

ARC ROUTING; INFEASIBLE SOLUTIONS; META HEURISTICS; PATH RELINKING; REACTIVE PARAMETERS;

HEURISTIC ALGORITHMS;

NETWORK ROUTING;

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

References (49)

1. B.L. Golden, and R.T. Wong Capacitated arc routing problems Networks 11 1981 305 315
2. H.A. Eiselt, M. Gendreau, and G. Laporte Arc routing problems, part II: the rural postman problem Operations Research 43 3 1995 399 414
3. Assad AA, Golden BL, Arc routing methods and applications. in: Ball MO, Magnanti TL, CM Nemhauser G, (Eds.), Network routing, vol. 8. 1995; Elsevier; pp. 375 - 483.
4. M. Dror Arc routing: theory, solutions and applications 1st ed. 2001 Kluwer Academic Press ISBN: 0792378989
5. F.L. Usberti, P.M. França, and A.L.M. França The open capacitated arc routing problem Computers and Operations Research 38 11 2011 1543 1555
6. H.I. Stern, and M. Dror Routing electric meter readers Computers and Operations Research 6 1979 209 223
7. L.M. Moreira, J.F. Oliveira, A.M. Gomes, and J.S. Ferreira Heuristics for a dynamic rural postman problem Computers and Operations Research 34 2007 3281 3294 (Pubitemid 46517857)
8. R. Hirabayashi, Y. Saruwatari, and N. Nishida Tour construction algorithm for the capacitated arc routing problem Asia-Pacific Journal of Operational Research 9 1992 155 175
9. H. Longo, M.P. de Aragão, and E. Uchoa Solving capacitated arc routing problems using a transformation to the CVRP Computers and Operations Research 33 6 2006 1823 1837 (Pubitemid 41525712)
10. S. Wøhlk An approximation algorithm for the capacitated arc routing problem The Open Operational Research Journal 2 2008 8 12
11. A. Assad, W.L. Pearn, and B.L. Golden The capacitated chinese postman problem: lower bounds and solvable cases American Journal of Mathematical and Management Science 7 1987 63 88 (Pubitemid 17616556)
12. M.C. Mourão, and M.T. Almeida Lower-bounding and heuristic methods for a refuse collection vehicle routing problem European Journal of Operational Research 121 2 2000 420 434 (Pubitemid 30531556)
13. W.L. Pearn New lower bounds for the capacitated arc routing problems Networks 18 1988 181 191
14. E. Benavent, V. Campos, A. Corberán, and E. Mota The capacitated arc routing problem: lower bounds Networks 22 1992 669 690
15. J.M. Belenguer, and E. Benavent A cutting plane algorithm for the capacitated arc routing problem Computers and Operations Research 30 2003 705 728 (Pubitemid 36178578)
16. S. Wøhlk New lower bound for the capacitated arc routing problem Computers and Operations Research 33 12 2006 3458 3472
17. J.M. Belenguer, E. Benavent, P. Lacomme, and C. Prins Lower and upper bounds for the mixed capacitated arc routing problem Computers and Operations Research 33 2006 3363 3383
18. L. Gouveia, M.C. Mourão, and L.S. Pinto Lower bounds for the mixed capacitated arc routing problem Computers and Operations Research 37 4 2010 692 699
19. B.L. Golden, J.S. DeArmon, and E.K. Baker Computational experiments with algorithms for a class of routing problems Computers and Operations Research 10 1 1983 47 59 (Pubitemid 13493950)
20. L. Santos, J. Coutinho-Rodrigues, and J.R. Current An improved heuristic for the capacitated arc routing problem Computers and Operations Research 36 2009 2632 2637
21. W.L. Pearn Augment-insert algorithms for the capacitated arc routing problem Computers and Operations Research 18 1991 189 198
22. R.W. Eglese, and L.Y.O. Li A tabu search based heuristic for arc routing with a capacity constraint and time deadline I.H. Osman, J.P. Kelly, Metaheuristics: theory and applications 1996 Kluwer
23. A. Hertz, G. Laporte, and M. Mittaz A tabu search heuristic for the capacitated arc routing problem Operations Research 48 1 2000 129 135
24. J. Brandão, and R. Eglese A deterministic tabu search algorithm for the capacitated arc routing problem Computers and Operations Research 35 2008 1112 1126 (Pubitemid 47558960)
25. P. Lacomme, C. Prins, and W. Ramdane-Chérif Competitive memetic algorithms for arc routing problems Annals of Operations Research 131 2004 159 185 (Pubitemid 39187378)
26. P. Greistorfer A tabu scatter search metaheuristic for the arc routing problem Computers and Industrial Engineering 44 2003 249 266
27. P. Beullens, L. Muyldermans, D. Cattrysse, and D.V. Oudheusden A guided local search heuristic for the capacitated arc routing problem European Journal of Operational Research 147 2003 629 643
28. A. Hertz, and M. Mittaz A variable neighborhood descent algorithm for the undirected capacitated arc routing problem Transportation Science 35 4 2001 425 434 (Pubitemid 34125359)
29. M. Polacek, K. Doerner, R. Hartl, and V. Maniezzo A variable neighborhood search for the capacitated arc routing problem with intermediate facilities Journal of Heuristics 14 2008 405 423
30. V. Maniezzo, and M. Roffilli Algorithms for large directed capacitated arc routing problem instances C. Cotta, J. van Hemert, Recent advances in evolutionary computation for combinatorial optimization vol. 153 2008 Springer Berlin, Heidelberg 259 274
31. L. Santos, J. Coutinho-Rodrigues, and J.R. Current An improved ant colony optimization based algorithm for the capacitated arc routing problem Transportation Research Part B: Methodological 44 2 2010 246 266
32. C. Prins, and R.W. Calvo A fast GRASP with path relinking for the Capacitated Arc Routing Problem Proceeding of INOC 2005 (third international network optimization conference) 2005 University of Lisbon 289 295
33. N. Labadi, C. Prins, and M. Reghioui GRASP with path relinking for the capacitated arc routing problem with time windows A. Fink, F. Rothlauf, Advances in computational intelligence in transport, logistics, and supply chain management vol. 144 2008 Springer Berlin, Heidelberg 111 135
34. A. Hertz Recent trends in arc routing R. Sharda, S. Voß, M.C. Golumbic, I.B.A. Hartman, Graph theory, combinatorics and algorithms 2005 Springer US
35. S. Wøhlk A decade of capacitated arc routing R. Sharda, S. Voß, B. Golden, S. Raghavan, E. Wasil, The vehicle routing problem: latest advances and new challenges vol. 43 2008 Springer US 29 48
36. A. Corberán, and C. Prins Recent results on arc routing problems: an annotated bibliography Networks 56 1 2010
37. T.A. Feo, and M.G.C. Resende Greedy randomized adaptive search procedures Journal of Global Optimization 6 1995 109 133
38. C. Prins A GRASP ×evolutionary local search hybrid for the vehicle routing problem F. Pereira, J. Tavares, Bio-inspired algorithms for the vehicle routing problem vol. 161 2009 Springer Berlin, Heidelberg 35 53
39. J.G. Villegas, C. Prins, C. Prodhon, A.L. Medaglia, and N. Velasco A GRASP with evolutionary path relinking for the truck and trailer routing problem Computers and Operations Research 38 2011 1319 1334
40. M.G.C. Resende, and C.C. Ribeiro GRASP with path-relinking: recent advances and applications Metaheuristics: progress as Real Problem Solvers 2005 Springer 29 63
41. W.L. Pearn Approximate solutions for the capacitated arc routing problem Computers and Operations Research 16 1989 589 600
42. M. Prais, and C.C. Ribeiro Reactive GRASP: an application to a matrix decomposition problem in TDMA traffic assignment INFORMS Journal on Computing 12 2000 164 176
43. F. Glover Infeasible/feasible search trajectories and directional rounding in integer programming Journal of Heuristics 13 2007 505 541 (Pubitemid 350096282)
44. T.A. Feo, M.G.C. Resende, and S.H. Smith A greedy randomized adaptive search procedure for maximum independent set Operations Research 42 5 1994 860 878
45. F. Glover Tabu search and adaptive memory programming - advances, applications and challenges Interfaces in computer science and operations research 1996 Kluwer 1 75
46. M.G.C. Resende, and R.F. Werneck A hybrid heuristic for the p-median problem Journal of Heuristics 10 2004 59 88
47. M.G.C. Resende, R. Martí, M. Gallego, and A. Duarte GRASP and path relinking for the max-min diversity problem Computers and Operations Research 37 3 2010 498 508 (Hybrid metaheuristics)
48. C.C. Ribeiro, and M.G.C. Resende Path-relinking intensification methods for stochastic local search algorithms Journal of Heuristics 2011 10.1007/s10732-011-9167-1
49. L.Y.O. Li, and R.W. Eglese An interactive algorithm for vehicle routing for winter-gritting Journal of the Operational Research Society 47 1996 217 228 (Pubitemid 126578669)