Skip to Main content Skip to Navigation
Journal articles

A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem

Abstract : A generalization of the traditional vehicle routing problem (VRP) is studied in this paper. Each customer may order several products, the vehicles are identical and have several compartments, each compartment being dedicated to one product. The demand of each customer for a product must be entirely delivered by one single vehicle. However, the different products required by a customer may be brought by several vehicles. Two algorithms to solve this problem are proposed: a memetic algorithm with a post-optimization phase based on path relinking, and a tabu search method. These algorithms are evaluated by adding compartments to classical VRP instances.
Document type :
Journal articles
Complete list of metadatas

https://hal-utt.archives-ouvertes.fr/hal-02477276
Contributor : Daniel Gavrysiak <>
Submitted on : Thursday, February 13, 2020 - 11:57:02 AM
Last modification on : Monday, April 20, 2020 - 2:14:09 PM

Identifiers

Collections

ROSAS | UTT | CNRS

Citation

Abdellah El Fallahi, Christian Prins, Roberto Wolfler Calvo. A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem. Computers and Operations Research, Elsevier, 2008, 35 (5), pp.1725-1741. ⟨10.1016/j.cor.2006.10.006⟩. ⟨hal-02477276⟩

Share

Metrics

Record views

34