6533b82efe1ef96bd12928d1
RESEARCH PRODUCT
Time-Dependent Multiple Depot Vehicle Routing Problem on Megapolis Network under Wardrop's Traffic Flow Assignment
Tero TuovinenAlexander V. MugayskikhVictor Zakharovsubject
Mathematical optimizationroadsDepotComputer scienceTraffic Flow Assignment0211 other engineering and technologiesTime horizon02 engineering and technologylcsh:Telecommunicationoptimointilcsh:TK5101-67200502 economics and businessVehicle routing problemta113050210 logistics & transportationreititys021103 operations researchtiet05 social sciencesbiological system modelingTraffic flowMultiple Depot Vehicle Routing ProblemVariable (computer science)suunnitteluroutingShortest path problemTime-Dependent Routing ProblemRouting (electronic design automation)planningMegapolis NetworkAssignment problemvehicle routingoptimizationdescription
In this work multiple depot vehicle routing problem is considered in case of variable travel times between nodes on a metropolis network. This variant of the classic multiple depot vehicle routing problem is motivated by the fact that in urban contexts variable traffic conditions play an essential role and can not be ignored in order to perform a realistic optimization. Time-travel matrices corresponding to each period of planning horizon were formed by solving the traffic assignment problem in conjunction with shortest path problem. Routing problem instances include from 20 to 100 customers randomly chosen from a road network of Saint-Petersburg. The results demonstrate that taking into account traffic flow information can reduce route time by 8-37% depending on number of customers in the problem instance.
| year | journal | country | edition | language |
|---|---|---|---|---|
| 2018-05-01 |