 |
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.
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 : Sunday, June 26, 2022 - 1:38:41 AM
Contributor : Daniel Gavrysiak Connect in order to contact the contributor
Submitted on : Friday, February 28, 2020 - 11:45:36 AM
Last modification on : Sunday, June 26, 2022 - 1:38:41 AM
Links full text
