Solving the assignment of customers to trucks and visiting days in a periodic routing real-world case
Fecha
2018-02-01
Título de la revista
ISSN de la revista
Título del volumen
Editor
Resumen
Introduction: this work proposes a model, and two heuristic algorithms to assign customers to trucks and visiting days, as a first phase in the solution of a real-world routing problem, which is closely related to the Periodic vehicle routing problem
Descripción
Palabras clave
Heuristics, logistics, clustering, allocation, periodic routing