Cargando…
Dynamic vehicle routing with time windows in theory and practice
The vehicle routing problem is a classical combinatorial optimization problem. This work is about a variant of the vehicle routing problem with dynamically changing orders and time windows. In real-world applications often the demands change during operation time. New orders occur and others are can...
Autores principales: | Yang, Zhiwei, van Osta, Jan-Paul, van Veen, Barry, van Krevelen, Rick, van Klaveren, Richard, Stam, Andries, Kok, Joost, Bäck, Thomas, Emmerich, Michael |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Springer Netherlands
2016
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5309326/ https://www.ncbi.nlm.nih.gov/pubmed/28255293 http://dx.doi.org/10.1007/s11047-016-9550-9 |
Ejemplares similares
-
Modified artificial bee colony for the vehicle routing problems with time windows
por: Alzaqebah, Malek, et al.
Publicado: (2016) -
The Mobile Charging Vehicle Routing Problem with Time Windows and Recharging Services
por: Cui, Shaohua, et al.
Publicado: (2018) -
Improved artificial bee colony algorithm for vehicle routing problem with time windows
por: Yao, Baozhen, et al.
Publicado: (2017) -
Multi-Depot Open Vehicle Routing Problem with Time Windows Based on Carbon Trading
por: Shen, Ling, et al.
Publicado: (2018) -
A Combination of Genetic Algorithm and Particle Swarm Optimization for Vehicle Routing Problem with Time Windows
por: Xu, Sheng-Hua, et al.
Publicado: (2015)