A Hybrid metaheuristic algorithm for the vehicle routing problem with stochastic demands
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 validate...
Autores Principales: | , , , |
---|---|
Formato: | Artículo (Article) |
Lenguaje: | Inglés (English) |
Publicado: |
2020
|
Materias: | |
Acceso en línea: | http://hdl.handle.net/1992/47067 |