A multidepot VRP is solved in the context of total urban traffic equilibrium. Under the total traffic equilibrium, the multidepot VRP is changed to GDAP (the problem of Grouping Customers + Estimating OD Traffic + Assigning traffic) and bilevel programming is used to model the problem, where the upper model determines the customers that each truck visits and adds the trucks’ trips to the initial OD (Origin/Destination) trips, and the lower model assigns the OD trips to road network. Feedback between upper model and lower model is iterated through OD trips; thus total traffic equilibrium can be simulated.


    Access

    Download


    Export, share and cite



    Title :

    Multiple Depots Vehicle Routing Problem in the Context of Total Urban Traffic Equilibrium


    Contributors:


    Publication date :

    2017




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    Unknown




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

    Mezatio, Eric Papain | ORKG Comparisons | 2022

    Free access



    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