Skip to Main content Skip to Navigation
Conference papers

A memetic algorithm for the vehicle routing problem with stochastic demands

Abstract : This article introduces a Memetic Algorithm to solve the Vehicle Routing Problem with Stochastic Demands. Computational results show that the method outperforms two of the three state-of-the-art metaheuristics and is highly competitive in terms of quality and efficiency compared to the best metaheuristic when tested on 40 instances in the literature. Moreover the method can be easily extended to solve other stochastic problems taking into account both problems with recourse as well as probabilistic constraints.
Document type :
Conference papers
Complete list of metadatas

https://hal-utt.archives-ouvertes.fr/hal-02586029
Contributor : Jean-Baptiste Vu Van <>
Submitted on : Friday, May 15, 2020 - 9:50:07 AM
Last modification on : Wednesday, July 22, 2020 - 9:14:03 AM

Identifiers

  • HAL Id : hal-02586029, version 1

Collections

ROSAS | UTT | CNRS

Citation

Andres Gutierrez, Laurence Dieulle, Nacima Labadie, Nubia Velasco. A memetic algorithm for the vehicle routing problem with stochastic demands. 45th International Conference on Computers & Industrial Engineering (CIE45), Oct 2015, Metz, France. ⟨hal-02586029⟩

Share

Metrics

Record views

6