Skip to Main content Skip to Navigation
Conference papers

Evolutionary Algorithms for Capacitated Arc Routing problems with Time Windows

Wahiba Ramdane-Cherif 1
1 MACSI - Industrial system modeling, analysis and operation
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
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
Document type :
Conference papers
Complete list of metadata

Cited literature [19 references]  Display  Hide  Download

https://hal.inria.fr/inria-00104110
Contributor : Wahiba Ramdane Cherif <>
Submitted on : Sunday, November 16, 2008 - 7:00:02 AM
Last modification on : Sunday, March 28, 2021 - 11:18:03 PM
Long-term archiving on: : Tuesday, April 6, 2010 - 6:35:38 PM

File

WRC_INCOM2006.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00104110, version 1

Collections

Citation

Wahiba Ramdane-Cherif. Evolutionary Algorithms for Capacitated Arc Routing problems with Time Windows. 12th IFAC Symposium on Information Control Problems in Manufacturing - INCOM, Jun 2006, Saint-Etienne/France. ⟨inria-00104110⟩

Share

Metrics

Record views

348

Files downloads

593