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

Mohamed Reghioui (1) , Christian Prins (1) , Nacima Labadie (1)

1 LOSI - Laboratoire d'Optimisation des Systèmes Industriels

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.

Keywords: arc routing; time windows; GRASP; path relinking

Domains: Operations Research [cs.RO]

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⟩