With vast range of applications in real life situations, the Vehicle Routing Problems (VRPs) have been the subject of countless studies since the late 1950s. However, a more realistic version of the classical VRP, where the distribution of goods is done from several depots is the Multi-Depot Vehicle Routing Problem (MDVRP), which has been the central attraction of recent researches. The objective of this problem is to find the routes for vehicles to serve all the customers at a minimal cost in terms of the number of routes and the total distance travelled without violating the capacity and travel time constraints of the vehicles, and it is handled with a variety of assumptions and constraints in the existing literature. This survey reviews the current status of the MDVRP and discuss the future direction regarding this problem.


    Access

    Download


    Export, share and cite



    Title :

    Five years of multi-depot vehicle routing problems


    Contributors:


    Publication date :

    2020




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    Unknown




    Multi-Type Attention for Solving Multi-Depot Vehicle Routing Problems

    Li, Jinqi / Tian Dai, Bing / Niu, Yunyun et al. | IEEE | 2024



    On Solving the Multi-depot Vehicle Routing Problem

    Tlili, Takwa / Krichen, Saoussen / Drira, Ghofrane et al. | Springer Verlag | 2015


    Survey on Ten Years of Multi-Depot Vehicle Routing Problems: Mathematical Models, Solution Methods and Real-Life Applications

    Jayarathna, D. G. N. D. / Lanel, G. H. J. / Juman, Z. A. M. S. | BASE | 2021

    Free access

    Multi-Depot Vehicle Routing Problem with Hybrid Genetic Algorithm

    Dang, Li Wei ;Sun, Xiao Ming | Trans Tech Publications | 2012