A memetic algorithm for the vehicle routing problem with stochastic demands - Archive ouverte HAL Access content directly
Conference Papers Year :

A memetic algorithm for the vehicle routing problem with stochastic demands

(1) , (2) , (3) , (4)
1
2
3
4

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.
Not file

Dates and versions

hal-02586029 , version 1 (15-05-2020)

Identifiers

  • HAL Id : hal-02586029 , version 1

Cite

Andres Gutierrez, Laurence Dieulle, Nacima Labadie, Nubia M. 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⟩
10 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More