Solving the assignment of customers to trucks and visiting days in a periodic routing real-world case

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, but a strategic decision of the company imposes the additional constraint that every customer must always be visited by the same truck. Methods: The proposed model aims to group the customers that are visited the same day by the same truck as close as possible. The first proposed heuristic has a constructive stage, and five underlying improvement heuristic, the second one uses an exact linear programming algorithm. Results: The algorithms are evaluated by instances taken from the literature and generated, taking into account the characteristics presented in the real-world case addressed.

• Tipo de recurso: article
• Fecha de publicación: 2018
• Institución: Pontificia Universidad Javeriana
• Repositorio: Repositorio Universidad Javeriana
• Idioma: eng
• OAI Identifier: oai:repository.javeriana.edu.co:10554/25922
• Acceso en línea: http://revistas.javeriana.edu.co/index.php/iyu/article/view/18899; http://hdl.handle.net/10554/25922
• Rights: openAccess
• License: Copyright (c) 2017 Andres Felipe Duque Correa