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

Abstract EN

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.