A Microsimulation Based Analysis of Exact Solution of Dynamic Vehicle Routing with Soft Time Windows

Abstract This paper presents a microsimulation-based evaluation of an exact solution approach for the soft time windows variant of the Vehicle Routing Problem (VRP) that also considers penalties on the late arrival. The exact solution approach of the Dynamic Vehicle Routing and scheduling Problem with Soft Time Windows (D-VRPSTW) is based on the column generation (Dantzig-Wolfe decomposition) scheme; whereas VISSIM has been used to simulate the traffic network under normal as well as under traffic incident conditions. Evaluations shows that the D-VRPSTW helps in avoiding additional cost as well as lateness for the freight carriers, caused due to an unexpected change in travel times along the roads.

[1]  Zhi-Long Chen,et al.  Dynamic Column Generation for Dynamic Vehicle Routing with Time Windows , 2006, Transp. Sci..

[2]  Martin Desrochers,et al.  A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows , 1990, Oper. Res..

[3]  Eiichi Taniguchi,et al.  Travel Time Reliability in Vehicle Routing and Scheduling with Time Windows , 2006 .

[4]  東京都.  Industry and employment in Tokyo : a graphic overview , 2007 .

[5]  Robert B. Noland,et al.  Flow improvements and vehicle emissions: effects of trip generation and emission control technology , 2006 .

[6]  Haris N. Koutsopoulos,et al.  Simulation Laboratory for Evaluating Dynamic Traffic Management Systems , 1997 .

[7]  Nagraj Balakrishnan,et al.  Simple Heuristics for the Vehicle Routeing Problem with Soft Time Windows , 1993 .

[8]  Ali Qureshi.  Vehicle Routing and Scheduling with Uncertainty , 2014 .

[9]  Ali Gul Qureshi,et al.  Analysis of the Effects of a Cooperative Delivery System in Bangkok , 2006 .

[10]  Praveen Edara,et al.  Evaluation of travel demand strategies: a microscopic traffic simulation approach , 2010 .

[11]  Jacques Desrosiers,et al.  Technical Note - Optimizing the Schedule for a Fixed Vehicle Path with Convex Inconvenience Costs , 1989, Transp. Sci..

[12]  Stefan Irnich,et al.  The Shortest-Path Problem with Resource Constraints and k-Cycle Elimination for k 3 , 2006, INFORMS J. Comput..

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

[14]  Tadashi Yamada,et al.  Road Network reliability Analysis Using Vehicle Routing and Scheduling Procedures , 2004 .

[15]  Eiichi Taniguchi,et al.  INTELLIGENT TRANSPORTATION SYSTEM BASED DYNAMIC VEHICLE ROUTING AND SCHEDULING WITH VARIABLE TRAVEL TIMES , 2004 .

[16]  谷口 栄一,et al.  City logistics : network modelling and intelligent transport systems , 2001 .

[17]  Eiichi Taniguchi,et al.  Vehicle Routing and Scheduling , 2001 .

[18]  Lawrence Bodin,et al.  Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: I. Scheduling , 1985, Transp. Sci..

[19]  Toshihide Ibaraki,et al.  The vehicle routing problem with flexible time windows and traveling times , 2006, Discret. Appl. Math..

[20]  Vinícius Amaral Armentano,et al.  Adaptive granular local search heuristic for a dynamic vehicle routing problem , 2009, Comput. Oper. Res..

[21]  Eiichi Taniguchi,et al.  An evaluation methodology for city logistics , 2000 .

[22]  Roberto Horowitz,et al.  Congested Freeway Microsimulation Model Using VISSIM , 2004 .

[23]  Allan Larsen,et al.  The Dynamic Vehicle Routing Problem , 2000 .

[24]  Eiichi Taniguchi,et al.  An exact solution approach for vehicle routing and scheduling problems with soft time windows , 2009 .

[25]  Eiichi Taniguchi,et al.  Exact Solution for Vehicle Routing Problem with Soft Time Windows and Dynamic Travel Time , 2012 .

[26]  M W Burris,et al.  USING MICROSIMULATION TO QUANTIFY THE IMPACT OF ELECTRONIC TOLL COLLECTION , 1996 .

[27]  Jacques Desrosiers,et al.  2-Path Cuts for the Vehicle Routing Problem with Time Windows , 1997, Transp. Sci..

[28]  Michel Gendreau,et al.  An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems , 2004, Networks.

[29]  Harilaos N. Psaraftis,et al.  Dynamic vehicle routing: Status and prospects , 1995, Ann. Oper. Res..

[30]  Eiichi Taniguchi,et al.  Modelling Dynamic Vehicle Routing and Scheduling with Real Time Information on Travel Times , 2002 .

[31]  Dirck Van Vliet,et al.  Microsimulation models incorporating both demand and supply dynamics , 2006 .

[32]  Bernhard Fleischmann,et al.  Dynamic Vehicle Routing Based on Online Traffic Information , 2004, Transp. Sci..

[33]  Sylvie Gélinas,et al.  A dynamic programming algorithm for the shortest path problem with time windows and linear node costs , 1994, Networks.

[34]  J. Potvin,et al.  A dynamic capacitated arc routing problem with time-dependent service costs , 2011 .

[35]  Eiichi Taniguchi,et al.  Real time simulation of auctioning and re-scheduling processes in hybrid freight markets , 2007 .

[36]  Russell G Thompson,et al.  Vehicle Routing and Scheduling with Uncertainty , 2013 .