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

Descripción completa

Detalles Bibliográficos
Autores principales: Cacchiani, V., Hemmelmayr, V.C., Tricoire, F.
Formato: Online Artículo Texto
Lenguaje:English
Publicado: North Holland 2014
Materias:
Article
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

Internet

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