A hybrid metaheuristic algorithm for the vehicle routing problem with stochastic demands - Archive ouverte HAL Access content directly
Journal Articles Computers and Operations Research Year : 2018

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

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

Abstract

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

Dates and versions

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

Identifiers

Cite

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⟩
9 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More