EVOLUTIONARY ALGORITHMS FOR CAPACITATED ARC ROUTING PROBLEMS WITH TIME WINDOWS

Wahiba Ramdane-Cherif
2006 IFAC Proceedings Volumes  
The Capacitated Arc Routing Problem (CARP) involves vehicles routing, serving a set of arcs in a network. This NP hard problem is extended to take into account time windows, entailing a new and hard theoretical model in arc routing called the CARPTW (CARP with time windows). The CARPTW is useful for modeling urban waste collection or winter gritting. This paper presents this new model and a memetic algorithm with new memetic operators able to tackle the time windows constraints in arc routing.
doi:10.3182/20060517-3-fr-2903.00174 fatcat:7lscsz4gd5aadcmxydlnd5p5ki