EVOLUTIONARY ALGORITHMS FOR CAPACITATED ARC ROUTING PROBLEMS WITH TIME WINDOWS - Université de Lorraine Access content directly
Journal Articles IFAC Proceedings Volumes Year : 2006

EVOLUTIONARY ALGORITHMS FOR CAPACITATED ARC ROUTING PROBLEMS WITH TIME WINDOWS

Abstract

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.

Dates and versions

hal-02982803 , version 1 (29-10-2020)

Identifiers

Cite

Wahiba Ramdane Cherif-Khettaf. EVOLUTIONARY ALGORITHMS FOR CAPACITATED ARC ROUTING PROBLEMS WITH TIME WINDOWS. IFAC Proceedings Volumes, 2006, 39 (3), pp.321-326. ⟨10.3182/20060517-3-FR-2903.00174⟩. ⟨hal-02982803⟩
32 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More