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.
Multiple Depots Vehicle Routing Problem in the Context of Total Urban Traffic Equilibrium
2017
Article (Journal)
Electronic Resource
Unknown
Metadata by DOAJ is licensed under CC BY-SA 1.0
The vehicle routing problem with multiple depots (MDVRP) in supply chain
ORKG Comparisons | 2022
|Multiple depots vehicle routing based on the ant colony with the genetic algorithm
BASE | 2013
|Multiple depots vehicle routing based on the ant colony with the genetic algorithm
BASE | 2013
|Full Load Vehicle Routing with Multiple Depots: A New, Network Flow Based Algorithm
British Library Conference Proceedings | 2002
|