This paper discusses periodic vehicle routing problems that allow vehicles to travel on multiple trips in a single day. It is known as the Multi-Trip Periodic Vehicles (MTPVRP) Problem Route. Cluster-first route-second (CFRS) heuristics to solve MTPVRP was proposed in this study. In phase 1, customers were divided into clusters using the formulation of integer programming. Phase 2 determined the route of the cluster and verifies that the total journey time to visit the trips does not exceed the working hours of the vehicle. The implementation of the heuristic CFRS to solve the real problem faced by the LPG distributor shows that the procedure could provide a better routing solution.
A Cluster-First Route-Second Heuristic Approach to Solve The Multi-Trip Periodic Vehicle Routing Problem
2019
Aufsatz (Zeitschrift)
Elektronische Ressource
Unbekannt
Metadata by DOAJ is licensed under CC BY-SA 1.0
A cluster-first route-second approach for the swap body vehicle routing problem
Springer Verlag | 2016
|Taylor & Francis Verlag | 2020
|A congestion-aware Tabu search heuristic to solve the shared autonomous vehicle routing problem
Taylor & Francis Verlag | 2021
|Route Minimization Heuristic for the Vehicle Routing Problem with Multiple Pauses
Springer Verlag | 2017
|Route Minimization Heuristic for the Vehicle Routing Problem with Multiple Pauses
British Library Conference Proceedings | 2015
|