The Vehicle Routing Problem (VRP) is one of the most studied topics in Operations Research. Among the numerous variants of the VRP, this research addresses the VRP with relaxed priority rules (VRP-RPR) in which customers are assigned to several priority groups and customers with the highest priorities typically need to be served before lower priority ones. Additional rules are used to control the trade-off between priority and cost efficiency. We propose a Mixed Integer Linear Programming (MILP) model to formulate the problem and to solve small-sized instances. A metaheuristic based on the Adaptive Large Neighborhood Search (ALNS) algorithm with problem-tailored components is then designed to handle the problem at larger scales. The experimental results demonstrate the performance of our proposed algorithm. Remarkably, it outperforms a metaheuristic recently proposed to solve the Clustered Traveling Saleman Problem with d-relaxed priority rule (CTSP-d), a special case of VRP-RPR, in both solution quality and computational time.


    Zugriff

    Download


    Exportieren, teilen und zitieren



    Titel :

    The vehicle routing problem with relaxed priority rules


    Beteiligte:
    Thanh Tan Doan (Autor:in) / Nathalie Bostel (Autor:in) / Minh Hoàng Hà (Autor:in)


    Erscheinungsdatum :

    2021




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Unbekannt





    Systems and Methods for Automated Vehicle Routing Using Relaxed Dual Optimal Inequalities for Relaxed Columns

    HAGHANI NAVEED / CONTARDO CLAUDIO / YARKONY JULIAN | Europäisches Patentamt | 2021

    Freier Zugriff

    Adaptation Plan Policy in Traffic Routing for Priority Vehicle

    Hardinda, Krishna Priawan / Sei, Yuichi / Tahara, Yasuyuki et al. | IEEE | 2020



    Vehicle Routing Problem

    Balaji, Bharathan | DataCite | 2024