GRASP with Path Relinking for the Capacitated Arc Routing Problem with Time Windows - Archive ouverte HAL Access content directly
Book Sections Year : 2007

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

(1) , (1) , (1)
1

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.

Dates and versions

hal-02493895 , version 1 (28-02-2020)

Identifiers

Cite

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⟩

Collections

CNRS UTT LOSI
5 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More