Abstract
A greedy randomized adaptive search procedure with path relinking is presented for the capacitated arc routing problem with time windows. Contrary to the vehicle routing problem with time windows, this problem received little attention. Numerical experiments indicate that the proposed metaheuristic is competitive with the best published algorithms: on a set of 24 instances, it reaches the optimum 17 times and improves the best-known solution 5 times, including 4 new optima. © Springer-Verlag Berlin Heidelberg 2007.
Author supplied keywords
Cite
CITATION STYLE
Reghioui, M., Prins, C., & Labadi, N. (2007). GRASP with path relinking for the capacitated arc routing problem with time windows. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4448 LNCS, pp. 722–731). Springer Verlag. https://doi.org/10.1007/978-3-540-71805-5_78
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
