The vehicle routing problem (VRP) is one of the most studied problems in the field of optimization and operations research. In this comparison, we present a few studies on the multiple depot vehicle routing problem (MDVRP). This comparison considers several variants : time windows, split delivery, heterogeneous fleet, periodic deliveries, and pick-up and delivery. It also classifies the approaches according to the single or multiple objectives that are optimized.


    Access

    Access via TIB


    Export, share and cite



    Title :

    The vehicle routing problem with multiple depots (MDVRP) in supply chain


    Contributors:

    Publication date :

    2022



    Type of media :

    Research Data


    Type of material :

    Electronic Resource


    Language :

    English






    MILP Model for a Generalized Capacitated Vehicle Routing Problem with Multiple Depots and Multiple Pickup and Delivery Requests

    Sierra, Marta / Casanova, María / García-Sánchez, Álvaro et al. | Springer Verlag | 2024



    Full Load Vehicle Routing with Multiple Depots: A New, Network Flow Based Algorithm

    Zhang, M. / Jiang, D. / Tang, X. et al. | British Library Conference Proceedings | 2002


    Full Load Vehicle Routing with Multiple Depots: A New, Network Flow Based Algorithm

    Zhang, Mingshan / Jiang, Dali / Tang, Xiaowo | ASCE | 2002