A hybrid metaheuristic algorithm for the vehicle routing problem with stochastic demands - Université de technologie de Troyes Accéder directement au contenu
Article Dans Une Revue Computers and Operations Research Année : 2018

A hybrid metaheuristic algorithm for the vehicle routing problem with stochastic demands

Résumé

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.
Fichier non déposé

Dates et versions

hal-02477121 , version 1 (13-02-2020)

Identifiants

Citer

Andres Gutierrez, Laurence Dieulle, Nacima Labadie, Nubia Velasco. A hybrid metaheuristic algorithm for the vehicle routing problem with stochastic demands. Computers and Operations Research, 2018, 99, pp.135-147. ⟨10.1016/j.cor.2018.06.012⟩. ⟨hal-02477121⟩
13 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More