Cargando…
A set-covering based heuristic algorithm for the periodic vehicle routing problem
We present a hybrid optimization algorithm for mixed-integer linear programming, embedding both heuristic and exact components. In order to validate it we use the periodic vehicle routing problem (PVRP) as a case study. This problem consists of determining a set of minimum cost routes for each day o...
Autores principales: | Cacchiani, V., Hemmelmayr, V.C., Tricoire, F. |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
North Holland
2014
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3990422/ https://www.ncbi.nlm.nih.gov/pubmed/24748696 http://dx.doi.org/10.1016/j.dam.2012.08.032 |
Ejemplares similares
-
An adaptive large neighborhood search heuristic for Two-Echelon Vehicle Routing Problems arising in city logistics
por: Hemmelmayr, Vera C., et al.
Publicado: (2012) -
A Heuristic Approach Based on Clarke-Wright Algorithm for Open Vehicle Routing Problem
por: Pichpibul, Tantikorn, et al.
Publicado: (2013) -
Sequential Insertion Heuristic with Adaptive Bee Colony Optimisation Algorithm for Vehicle Routing Problem with Time Windows
por: Jawarneh, Sana, et al.
Publicado: (2015) -
Bio-inspired algorithms for the vehicle routing problem
por: Tavares, Jorge, et al.
Publicado: (2008) -
Orienteering problems: models and algorithms for vehicle routing problems with profits
por: Vansteenwegen, Pieter, et al.
Publicado: (2019)