Skip to Main content Skip to Navigation
Journal articles

A memetic algorithm for the vehicle routing problem with time windows

Abstract : This article deals with the vehicle routing problem with time windows (VRPTW). This problem consists in determining a least-cost set of trips to serve customers during specific time windows. The proposed solution method is a memetic algorithm (MA), a genetic algorithm hybridised with a local search. Contrary to most papers on the VRPTW, which minimize first the number of vehicles, our method is also able to minimize the total distance travelled. The results on 56 classical instances are compared to those of the best metaheuristics. The efficiency of the MA is similar for the classical criterion, but it becomes the best algorithm available for the total distance, being much faster and improving 20 best-known solutions.
Document type :
Journal articles
Complete list of metadatas

https://hal-utt.archives-ouvertes.fr/hal-02477527
Contributor : Daniel Gavrysiak <>
Submitted on : Thursday, February 13, 2020 - 2:26:12 PM
Last modification on : Tuesday, June 2, 2020 - 9:22:02 AM

Links full text

Identifiers

Collections

ROSAS | UTT | CNRS

Citation

Nacima Labadie, Christian Prins, Mohamed Reghioui. A memetic algorithm for the vehicle routing problem with time windows. RAIRO - Operations Research, EDP Sciences, 2008, 42 (3), pp.415-431. ⟨10.1051/ro:2008021⟩. ⟨hal-02477527⟩

Share

Metrics

Record views

38