Services on Demand
Journal
Article
Indicators
- Cited by SciELO
- Access statistics
Related links
- Cited by Google
- Similars in SciELO
- Similars in Google
Share
Ingeniería y Universidad
Print version ISSN 0123-2126
Abstract
DUQUE-CORREA, Andrés Felipe and PENA, María Gulnara Baldoquín de la. Solving the Assignment of Customers to Trucks and Visit Days in a Periodic Routing Real-World Case. Ing. Univ. [online]. 2018, vol.22, n.1, pp.53-76. ISSN 0123-2126. https://doi.org/10.11144/javeriana.iyu22-1.sact.
Introduction:
This work proposes a model and two heuristic algorithms to assign customers to trucks and visit days as a first phase in the solution of a real-world routing problem, which is closely related to the PVRP (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 will group the customers that are visited the same day by the same truck as close as possible by means of centroid-based clustering. The first proposed heuristic has a constructive stage and three underlying improvement heuristics, while the second 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.
Keywords : logistics; clustering; allocation; heuristics; periodic routing.