We found a match
Your institution may have rights to this item. Sign in to continue.
- Title
Solving the assignment of customers to trucks and visit days in a periodic routing real-world case.
- Authors
Duque Correa, Andrés Felipe; de la Peña, María Gulnara Baldoquín
- Abstract
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.
- Subjects
HEURISTIC algorithms; ROUTING (Computer network management); LINEAR programming; CLUSTER analysis (Statistics); DECISION making
- Publication
Ingeniería y Universidad, 2018, Vol 22, Issue 1, p71
- ISSN
0123-2126
- Publication type
Article
- DOI
10.11144/Javeriana.iyu22-1.sact