A hybrid metaheuristic approach for the capacitated arc routing problem

European Journal of Operational Research

Volumn 253, Issue 1, 2016, Pages 25-39

  Chen, Yuning ^a   Hao, Jin Kao ^a,b   Glover, Fred ^c  

^a UNIVERSITÉ D'ANGERS   (France)

^b INSTITUT UNIVERSITAIRE DE FRANCE   (France)

^c OptTek Systems Inc   (United States)

Author keywords

Capacitated arc routing problem; Memetic search; Tabu thresholding

Indexed keywords

BENCHMARKING; COMBINATORIAL OPTIMIZATION; NETWORK ROUTING; OPTIMIZATION;

CAPACITATED ARC ROUTING PROBLEM; COMBINATORIAL OPTIMIZATION PROBLEMS; CROSSOVER OPERATOR; HYBRID META-HEURISTIC; LOCAL REFINEMENT PROCEDURE; MEMETIC; THRESHOLDING; THRESHOLDING PROCEDURES;

PROBLEM SOLVING;

EID: 84977943193     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2016.02.015     Document Type: Article

References (35)

1. Baldacci R., and Maniezzo V. Exact methods based on noderouting formulations for undirected arcrouting problems Networks 47 1 2006 52 60
2. Bartolini E., Cordeau J.F., and Laporte G. Improved lower bounds and exact algorithm for the capacitated arc routing problem Mathematical Programming 137 1-2 2013 409 452
3. Benavent E., Campos V., Corberan E., and Mota E. The capacitated arc routing problem: lower bounds Networks 22 4 1992 669 690
4. Beullens P., Muyldermans L., Cattrysse D., and Van Oudheusden D. A guided local search heuristic for the capacitated arc routing problem European Journal of Operational Research 147 3 2003 629 643
5. Birattari M., Yuan Z., Balaprakash P., and Stützle T. F-Race and iterated F-Race: An overview Experimental methods for the analysis of optimization algorithms 2010 Springer Berlin, Germany 311 336
6. Bode C., and Irnich S. Cut-first branch-and-price-second for the capacitated arc-routing problem Operations research 60 5 2012 1167 1182
7. Brandão J., and Eglese R. A deterministic tabu search algorithm for the capacitated arc routing problem Computers & Operations Research 35 4 2008 1112 1126
8. Corberán A., and Laporte G. Arc routing: problems, methods, and applications MOS-SIAM series on optimization 20 2015 SIAM
9. DeArmon J.S. A comparison of heuristics for the capacitated chinese postman problems 1981 University of Maryland, College Park, MD Master thesis
10. Dror M. Arc routing: Theory, solutions and applications 2000 Kluwer Academic Publishers
11. Eglese R.W. Routing winter gritting vehicles Discrete Applied Mathematics 48 3 1994 231 244
12. Glover F. Tabu thresholding: Improved search by nonmonotonic trajectories ORSA Journal on Computing 7 4 1995 426 442
13. Glover F., and Hao J.K. The case for strategic oscillation Annals of Operations Research 183 1 2011 163 173
14. Glover F., and Kochenberger G. Handbook of metaheuristics 2003 Kluwer, Norwell, Massachusetts, USA
15. Glover F., and Laguna M. Tabu search 1997 Kluwer Academic Publishers
16. Golden B.L., DeArmon J.S., and Baker E.K. Computational experiments with algorithms for a class of routing problems Computers & Operations Research 10 1 1983 47 59
17. Golden B.L., and Wong R.T. Capacitated arc routing problems Networks 11 3 1981 305 315
18. Hao J.K. Memetic algorithms in discrete optimization F. Neri, C. Cotta, P. Moscato, Handbook of memetic algorithms. studies in computational intelligence 379, chapter 6 2012 7394
19. Hertz A., Laporte G., and Mittaz M. A tabu search heuristic for the capacitated arc routing problem Operations research 48 1 2000 129 135
20. Hertz A., and Mittaz M. A variable neighborhood descent algorithm for the undirected capacitated arc routing problem Transportation science 35 4 2001 425 434
21. Lacomme P., Prins C., and Ramdane-Cherif W. Competitive memetic algorithms for arc routing problems Annals of Operations Research 131 1-4 2004 159 185
22. López-Ibáñez M., Dubois-Lacoste J., Stützle T., and Birattari M. The irace package, iterated race for automatic algorithm configuration Technical Report, TR/IRIDIA/2011-004 2011 IRIDIA, Universit Libre de Bruxelles, Belgium
23. Martinelli R., Poggi M., and Subramanian A. Improved bounds for large scale capacitated arc routing problem Computers & Operations Research 40 8 2013 2145 2160
24. Mei Y., Li X., and Yao X. Cooperative coevolution with route distance grouping for large-scale capacitated arc routing problems IEEE Transactions on Evolutionary Computation 18 3 2014 435 449
25. Mei Y., Tang K., and Yao X. A global repair operator for capacitated arc routing problem IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics 39 3 2009 723 734
26. Moscato P. On evolution, search, optimization, genetic algorithms and martial arts: Towards memetic algorithms Caltech Concurrent Computation Program, C3P Report 826 1989
27. Moscato P., and Cotta C. A gentle introduction to memetic algorithms F. Glover, G.A. Kochenberger, Handbook of metaheuristics. Kluwer, Norwell, Massachusetts, USA 2003
28. Neri F., Cotta C. & Moscato P. (Eds.) (2011). Handbook of memetic algorithms. In: Studies in Computational Intelligence 379, Springer.
29. Polacek M., Doerner K.F., Hartl R.F., and Maniezzo V. A variable neighborhood search for the capacitated arc routing problem with intermediate facilities Journal of Heuristics 14 5 2008 405 423
30. Potvin J.Y., and Bengio S. The vehicle routing problem with time windows part II: genetic search INFORMS Journal on Computing 8 2 1996 165 172
31. Santos L., Coutinho-Rodrigues J., and Current J.R. An improved ant colony optimization based algorithm for the capacitated arc routing problem Transportation Research Part B: Methodological 44 2 2010 246 266
32. Stern H.I., and Dror M. Routing electric meter readers Computers & Operations Research 6 4 1979 209 223
33. Tang K., Mei Y., and Yao X. Memetic algorithm with extended neighborhood search for capacitated arc routing problems IEEE Transactions on Evolutionary Computation 13 5 2009 1151 1166
34. Ulusoy G. The fleet size and mix problem for capacitated arc routing European Journal of Operational Research 22 3 1985 329 337
35. Usberti F.L., Paulo M.F., and André L.M.F. GRASP with evolutionary path-relinking for the capacitated arc routing problem Computers & Operations Research 40 12 2013 3206 3217