MAENS+: A divide-and-conquer based memetic algorithm for capacitated arc routing problem

Proceedings - 2011 4th International Symposium on Computational Intelligence and Design, ISCID 2011

Volumn 1, Issue , 2011, Pages 83-88

  Chen, Xiaomeng ^a  

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

Author keywords

CARP; Divide and conquer; MAENS; MAENS+; MS operator

Indexed keywords

ADAPTIVE METHODS; CAPACITATED ARC ROUTING PROBLEM; CARP; COMPUTATIONAL COSTS; COMPUTATIONAL TIME; DIVIDE-AND-CONQUER; LARGE GRAPHS; LOCAL SEARCH OPERATORS; MAENS; MEMETIC ALGORITHMS; MS OPERATOR; NEIGHBORHOOD SEARCH; SOLUTION QUALITY; SUBGRAPHS;

ARTIFICIAL INTELLIGENCE;

ALGORITHMS;

EID: 83455220295     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISCID.2011.30     Document Type: Conference Paper

References (16)

1. M. Dror, Ed., Arc Routing: Theory, Solutions and Applications. Boston, MA: Kluwer, 2000.
2. R. Hirabayashi R, Y.aruwatari, and N.Nishida, "Tour construction algorithm for the capacitated arc routing problem," Asia-pacific Journal of operational Research, no, 3, 1992, pp.155-175.
3. B. L. Golden, J. S. DeArmon, and E. K. Baker, "Computational experiments with algorithms for a class of routing problems," Comput. Oper. Res., vol.10, no.1, 1983, pp.47-59.
4. G. Ulusoy, "The fleet size and mix problem for capacitated arc routing," Eur. J. Oper. Res., vol.22, no.3, 1985pp.329-337. (Pubitemid 15602978)
5. A. Hertz, G. Laporte, and M. Mittaz, "A tabu search heuristic for the capacitated arc routing problem," Oper. Res., vol.48, no.1, 2000, pp.129-135.
6. A. Hertz and M.Mittaz, "A variable neighborhood descent algorithm for the undirected capacitated arc routing problem," Transport. Sci., vol.35, no.4, 2001, pp.425-434. (Pubitemid 34125359)
7. P. Beullens, L. Muyldermans, D. Cattrysse, and D. V. Oudheusden, "A guided local search heuristic for the capacitated arc routing problem," Eur. J. Oper. Res., vol.147, no.3, 2003, pp.629-643.
8. P. Lacomme, C. Prins, and W. Ramdane-Cherif, "Competitive memetic algorithms for arc routing problem," Ann. Oper. Res., vol.131, no.1-4, 2004, pp.159-185. (Pubitemid 39187378)
9. H. Handa, D. Lin, L. Chapman, and X. Yao, "Robust solution of salting route optimization using evolutionary algorithms," in Proc. IEEE Congr. Evol. Comput. Vancouver, BC, Canada, 2006, pp.3098-3105.
10. H. Handa, L. Chapman, and X. Yao, "Robust route optimization for gritting/salting trucks: A CERCIA experience," IEEE Comput. Intell. Mag., vol.1, no.1, Feb.2006, pp.6-9.
11. J. Brandao and R. Eglese, "A deterministic tabu search algorithm for the capacitated arc routing problem," Comput. Oper. Res., vol.35, no.4, 2008, pp.1112-1126. (Pubitemid 47558960)
12. K. Tang, Y. Mei, and X. Yao, "Memetic algorithm with extended neighborhood search(MAENS) for capacitated arc routing problem,"IEEE Trans. On Evol. Comput., vol.13, no.5, Oct. 2009, pp.1151-1166.
13. H. Fu, Y. Mei, K. Tang and Y. Zhu, "Memetic Algorithm with Heuristic Candidate List Strategy for Capacitated Arc Routing Problem," WCCI 2010 IEEE World Congress on Computational Intelligence-CCIB, Barcelona, Spain, July. 2010, pp.3229-3236.
14. Baker, J. E, "Reducing Bias and Inefficiency in the Selection Algorithm," In Proc. of the Second International Conference on Genetic Algorithms and their Application, Hillsdale, New Jersey, USA: Lawrence Erlbaum Associates, 1987, pp. 14-21.
15. J.Brandão and R. Eglese, "A deterministic tabu search algorithm for the capacitated arcrouting problem," Comput.Oper. Res., vol.35, no.4, pp.1112-1126, Apr.2008.
16. Wilcoxon. F, "Individual comparisons by ranking methods, "Biometrics Bulletin 1 (6), 1945, pp. 80-83.