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.


    Access

    Download


    Export, share and cite



    Title :

    A Cluster-First Route-Second Heuristic Approach to Solve The Multi-Trip Periodic Vehicle Routing Problem


    Contributors:


    Publication date :

    2019




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    Unknown




    A cluster-first route-second approach for the swap body vehicle routing problem

    Miranda-Bront, Juan José / Curcio, Brian / Méndez-Díaz, Isabel et al. | Springer Verlag | 2016


    The location-routing problem with multi-compartment and multi-trip: formulation and heuristic approaches

    Moon, Ilkyeong / Salhi, Said / Feng, Xuehao | Taylor & Francis Verlag | 2020


    A congestion-aware Tabu search heuristic to solve the shared autonomous vehicle routing problem

    Venkatraman, Prashanth / Levin, Michael W. | Taylor & Francis Verlag | 2021



    Route Minimization Heuristic for the Vehicle Routing Problem with Multiple Pauses

    Khmelev, Alexey | British Library Conference Proceedings | 2015