The Capacitated Arc Routing Problem (CARP) is a NPHard routing problem with strong connections with real world problems. In this work we aim to enhance the performance of MAENS, a stateof- the-art algorithm, through a self-adaptive scheme to choose the most suitable operator and a diversity-driven ranking operator. Experimental results on 181 problem instances show how these techniques can both improve the results of the current state-of-the-art algorithms and provide good directions to develop EAs with a more robust approximation ratio.
CITATION STYLE
Consoli, P., & Yao, X. (2014). Diversity-driven selection of multiple crossover operators for the capacitated arc routing problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8600, pp. 97–108). Springer Verlag. https://doi.org/10.1007/978-3-662-44320-0_9
Mendeley helps you to discover research relevant for your work.