A hybrid evolutionary algorithm for vehicle routing problem with stochastic demands
In this work we propose a hybrid dynamic programming evolutionary algorithm to solve the vehicle routing problem with stochastic demands, it is a well known NP-hard problem where uncertainty enhances the computational efforts required to obtain a feasible and near-optimal solution. We develop an evo...
- Autores:
-
Jaque Pirabán, Robinson Andrés
- Tipo de recurso:
- Fecha de publicación:
- 2015
- Institución:
- Universidad Nacional de Colombia
- Repositorio:
- Universidad Nacional de Colombia
- Idioma:
- spa
- OAI Identifier:
- oai:repositorio.unal.edu.co:unal/52953
- Acceso en línea:
- https://repositorio.unal.edu.co/handle/unal/52953
http://bdigital.unal.edu.co/47414/
- Palabra clave:
- 62 Ingeniería y operaciones afines / Engineering
Stochastic programming
Vehicle routing problem with stochastic demands
Dynamic programming
Logistics
Optimización estocástica
Problema de enrutamiento de vehículos con demandas estocásticas
Algoritmos
Programación dinámica,
Logística
- Rights
- openAccess
- License
- Atribución-NoComercial 4.0 Internacional
| Summary: | In this work we propose a hybrid dynamic programming evolutionary algorithm to solve the vehicle routing problem with stochastic demands, it is a well known NP-hard problem where uncertainty enhances the computational efforts required to obtain a feasible and near-optimal solution. We develop an evolutionary technique where a rollout dynamic programming algorithm is applied as local search method to improve the quality of solutions. Motivated by computational considerations, the rollout algorithm can be applied partially, so, this finds competitive solutions in large instances for which the global rollout dynamic programming strategy is time unfeasible. |
|---|