Time- Dependent Multiple Depot Vehicle Routing Problem on Megapolis Network under Wardrop's Traffic Flow Assignment

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.

[1]  Michel Gendreau,et al.  Time-dependent routing problems: A review , 2015, Comput. Oper. Res..

[2]  Miguel A. Figliozzi,et al.  The time dependent vehicle routing problem with time windows: Benchmark problems, an efficient solution algorithm, and solution characteristics , 2012 .

[3]  Arthur V. Hill,et al.  Modelling Intra-City Time-Dependent Travel Speeds for Vehicle Scheduling Problems , 1992 .

[4]  George B. Dantzig,et al.  The Truck Dispatching Problem , 1959 .

[5]  Mitsuo Gen,et al.  An adaptive genetic algorithm for the time dependent inventory routing problem , 2014, J. Intell. Manuf..

[6]  Roberto Montemanni,et al.  Time dependent vehicle routing problem with a multi ant colony system , 2008, Eur. J. Oper. Res..

[7]  David E. Boyce,et al.  Future research on urban transportation network modeling , 2007 .

[8]  S. Sumathi,et al.  Solution To Multi-Depot Vehicle Routing Problem Using Genetic Algorithms - TI Journals , 2012 .

[9]  Richard W. Eglese,et al.  Vehicle routing and scheduling with time-varying data: A case study , 2010, J. Oper. Res. Soc..

[10]  Ramasamy Panneerselvam,et al.  A Time-Dependent Vehicle Routing Problem with Time Windows for E-Commerce Supplier Site Pickups Using Genetic Algorithm , 2015 .

[11]  Simona Mancini,et al.  Time dependent travel speed vehicle routing and scheduling on a real road network: the case of Torino , 2014 .

[12]  Yiyo Kuo,et al.  Optimizing goods assignment and the vehicle routing problem with time-dependent travel speeds , 2009, Comput. Ind. Eng..

[13]  Will Maden,et al.  A Road TimetableTM to aid vehicle routing and scheduling , 2006, Comput. Oper. Res..

[14]  Chryssi Malandraki,et al.  A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem , 1996 .

[15]  W. Art Chaovalitwongse,et al.  Integrated Ant Colony and Tabu Search approach for time dependent vehicle routing problems with simultaneous pickup and delivery , 2014, J. Comb. Optim..

[16]  Alexander Skabardonis,et al.  Measuring Recurrent and Nonrecurrent Traffic Congestion , 2008 .

[17]  J. G. Wardrop,et al.  Some Theoretical Aspects of Road Traffic Research , 1952 .

[18]  Marius M. Solomon,et al.  Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints , 1987, Oper. Res..

[19]  A. Yu. Krylatov.  Network flow assignment as a fixed point problem , 2016 .

[20]  Michel Gendreau,et al.  Vehicle dispatching with time-dependent travel times , 2003, Eur. J. Oper. Res..

[21]  Gilbert Laporte,et al.  The time-dependent pollution-routing problem , 2013 .

[22]  Mark S. Daskin,et al.  Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms , 1992, Transp. Sci..

[23]  Jean-Philippe Vial,et al.  An Efficient Method to Compute Traffic Assignment Problems with Elastic Demands , 2008, Transp. Sci..

[24]  Bernhard Fleischmann,et al.  Time-Varying Travel Times in Vehicle Routing , 2004, Transp. Sci..

[25]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[26]  Philip Wolfe,et al.  An algorithm for quadratic programming , 1956 .