Improved memetic algorithm for capacitated arc routing problem

2009 IEEE Congress on Evolutionary Computation, CEC 2009

Volumn , Issue , 2009, Pages 1699-1706

  Mei, Yi ^a   Tang, Ke ^a   Yao, Xin ^a,b  

^a UNIVERSITY OF SCIENCE AND TECHNOLOGY OF CHINA   (China)

^b UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CAPACITATED ARC ROUTING PROBLEM; COMPUTATIONAL TIME; CROSSOVER OPERATIONS; EXPLICIT REPRESENTATION; IMPLICIT REPRESENTATION; LOCAL SEARCH; LOCAL SEARCH METHOD; MEMETIC ALGORITHMS; PROBLEM INSTANCES; REPRESENTATION SCHEMES; SEARCH PROCESS; SOLUTION QUALITY;

BENCHMARKING; CAVITY RESONATORS; EVOLUTIONARY ALGORITHMS;

ROUTING ALGORITHMS;

EID: 70449922699     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.2009.4983146     Document Type: Conference Paper

References (26)

1. M. Dror, Arc routing. Theory, solutions and applications. Boston: Kluwer Academic Publishers, 2000.
2. B. Golden and R. Wong, "Capacitated arc routing problems, " Networks, vol.11, no.3, pp. 305-315, 1981.
3. B. Golden, J. DeArmon, and E. Baker, "Computational experiments with algorithms for a class of routing problems, " Computers and Operations Research, vol.10, no.1, pp. 47-59, 1983.
4. G. Ulusoy, "The fleet size and mix problem for capacitated arc routing, " European Journal of Operational Research, vol.22, no.3, pp. 329-337, 1985.
5. W. Pearn, "Approximate solutions for the capacitated arc routing problem, " Computers and Operations Research, vol.16, no.6, pp. 589-600, 1989.
6. -, "Augment-insert algorithms for the capacitated arc routing problem, " Computers and Operations Research, vol.18, no.2, pp. 189-198, 1991.
7. A. Hertz, G. Laporte, and M. Mittaz, "A tabu search heuristic for the capacitated arc routing problem, " Operations Research, vol.48, no.1, pp. 129-135, 2000.
8. A. Hertz and M. Mittaz, "A variable neighborhood descent algorithm for the undirected capacitated arc routing problem, " Transportation Science, vol.35, no.4, pp. 425-434, 2001.
9. 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, vol.147, no.3, pp. 629-643, 2003.
10. P. Greistorfer, "A Tabu Scatter Search Metaheuristic for the Arc Routing Problem, " Computers and Industrial Engineering, vol.44, no.2, pp. 249-266, 2003.
11. P. Lacomme, C. Prins, and W. Ramdane-Chérif, "Competitive memetic algorithms for arc routing problem, " Annals of Operational Research, vol.131, no.1-4, pp. 159-185, 2004. (Pubitemid 39187378)
12. H. Handa, D. Lin, L. Chapman, and X. Yao, "Robust solution of salting route optimisation using evolutionary algorithms, " Proceedings of the 2006 IEEE Congress on Evolutionary Computation, pp. 3098-3105, 2006.
13. J. Brandao and R. Eglese, "A deterministic tabu search algorithm for the capacitated arc routing problem, " Computers and Operations Research, vol.35, no.4, pp. 1112-1126, 2008. (Pubitemid 47558960)
14. Y. Mei, K. Tang, and X. Yao, "A Global Repair Operator for Capacitated Arc Routing Problem, " IEEE Transactions on System, Man and Cybernetics, Part B, accepted in October 2008.
15. K. Tang, Y. Mei, and X. Yao, "Memetic Algorithm with Extended Neighborhood Search for Capacitated Arc Routing Problems, " IEEE Transactions on Evolutionary Computation, conditionally accepted in January 2009.
16. T. Schnier and X. Yao, "Using Multiple Representations in Evolutionary Algorithms, " Proceedings of the 2000 Congress on Evolutionary Computation (CEC'00), pp. 479-486, 2000.
17. E. W. Dijkstra, "A Note on Two Problems in Connection with Graphs, " Numerische Mathematik, vol.1, pp. 269-271, 1959.
18. I. M. Oliver, D. J. Smith, and J. R. C. Holland, "A Study of Permutation Crossover Operators on the Traveling Salesman Problem, " Proceedings of the 2nd International Conference on Genetic Algorithms, pp. 224-230, 1987.
19. R. W. Eglese, "Routing winter gritting vehicles, " Discrete Applied Mathematics, vol.48, no.3, pp. 231-244, 1994.
20. R. W. Eglese and L. Y. O. Li, "A tabu search based heuristic for arc routing with a capacity constraint and time deadline, " in Metaheuristics: theory and applications, I. H. Osman and J. P. Kelly, Eds. Boston: Kluwer Academic Publishers, 1996, pp. 633-650.
21. L. Y. O. Li and R. W. Eglese, "An interactive algorithm for vehicle routing for winter-gritting, " Journal of the Operational Research Society, vol.47, no.2, pp. 217-228, 1996.
22. J. S. DeArmon, "A comparison of heuristics for the capacitated Chinese postman problem, " Master's thesis, University of Maryland, College Park, MD, 1981.
23. E. Benavent, V. Campos, A. Corberän, and E. Mota, "The capacitated arc routing problem: lower bounds, " Networks, vol.22, no.7, pp. 669-690, 1992.
24. D. Ahr, "Contributions to multiple postmen problems, " Ph.D. dissertation, Rupercht-Karls-Universitat, Heidelberg, Germany, 2004.
25. R. Baldacci and V. Maniezzo, "Exact methods based on node-routing formulations for undirected arc-routing problems, " Networks, vol.47, no.1, pp. 52-60, 2006.
26. H. Longo, D. A. M. Poggi, and E. Uchoa, "Solving capacitated arc routing problems using a transformation to the CVRP." Computers and Operations Research, vol.33, no.6, pp. 1823-1837, 2006.