%0 Journal Article %T A hybrid metaheuristic algorithm for the vehicle routing problem with stochastic demands %+ Universidad de los Andes [Bogota] (UNIANDES) %+ Laboratoire d'Optimisation des Systèmes Industriels (LOSI) %+ Laboratoire Modélisation et Sûreté des Systèmes (LM2S) %A Gutierrez, Andres %A Dieulle, Laurence %A Labadie, Nacima %A Velasco, Nubia %< avec comité de lecture %@ 0305-0548 %J Computers and Operations Research %I Elsevier %V 99 %P 135-147 %8 2018-11 %D 2018 %R 10.1016/j.cor.2018.06.012 %K Vehicle routing %K Stochastic programming %K Stochastic demands %K Hybrid metaheuristic %K Memetic algorithm %K Greedy randomized adaptive search %Z Computer Science [cs]/Operations Research [cs.RO] %Z Computer Science [cs]/Data Structures and Algorithms [cs.DS]Journal articles %X This article deals with the Vehicle Routing Problem with Stochastic Demands. To solve this problem, a hybrid metaheuristic combining a Memetic Algorithm and Greedy Randomized Adaptive Search Procedure is designed. The developed approach is tested on a 40 instances benchmark. The results are validated by comparing them to state of the art metaheuristics, they show that our method outperforms these metaheuristics in terms of quality and efficiency. A new testbed of 39 instances with up to 385 customers is also proposed and tested. This paper is the first one to deal with closer to real life size problems. %G English %L hal-02477121 %U https://utt.hal.science/hal-02477121 %~ CNRS %~ UNIV-TROYES %~ UTT %~ UTT-LIST3N %~ LOSI %~ LM2S-UTT