Skip to Main content Skip to Navigation
Book sections

GRASP with Path Relinking for the Capacitated Arc Routing Problem with Time Windows

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.
Document type :
Book sections
Complete list of metadata

https://hal-utt.archives-ouvertes.fr/hal-02493895
Contributor : Daniel Gavrysiak Connect in order to contact the contributor
Submitted on : Friday, February 28, 2020 - 11:45:36 AM
Last modification on : Friday, August 27, 2021 - 3:14:07 PM

Links full text

Identifiers

Collections

UTT | CNRS

`

Citation

Mohamed Reghioui, Christian Prins, Nacima Labadie. GRASP with Path Relinking for the Capacitated Arc Routing Problem with Time Windows. Applications of Evolutinary Computing, 4448, Springer Berlin Heidelberg, pp.722-731, 2007, Lecture Notes in Computer Science, 978-3-540-71805-5. ⟨10.1007/978-3-540-71805-5_78⟩. ⟨hal-02493895⟩

Share

Metrics

Record views

54