The importance of information flows temporal attributes for the efficient scheduling of dynamic demand responsive transport services

Demand Responsive Transport Services (DRTS) are a type of public transportation characterized by the fact that the vehicles operate in response to calls from passengers to the transit operator, who then dispatches a vehicle to collect the clients and transport them to their destinations. This article describes the importance of accurate information flows, notably for time factors, for the efficient scheduling of dynamic DRTS. Dynamic systems are designed to handle changing situations such as incoming requests, customer no-shows at pickup points, vehicle breakdowns, or traffic congestion. The authors begin with a literature review on dynamic demand responsive systems, then describe the problem under study and the simulation process they used to solve it. The authors introduce and discuss some temporal parameters that can be seen as attributes of the information inflows of the scheduling process. The authors found that the relationship between the percentage of offline reservations and the number of rejected requests is not monotonic and is dependent on demand patterns. Fare discounts for early reservations have a positive effect on the scheduling efficiency only if they are determined to assume a critical percentage of offline requests. Pricing policies should be considered together with the performances of the scheduling software. The authors conclude that, in a dynamic environment trying to serve all the requests, a DRTS can lead to oversized fleets. If policy regulations do not allow for rejections, then it is more convenient to foresee the possibility of outsourcing a fraction of these to taxicabs.

[1]  Hani S. Mahmassani,et al.  Dynamic Decision Making for Commercial Fleet Operations Using Real-Time Information , 1996 .

[2]  Nigel H. M. Wilson,et al.  A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows , 1986 .

[3]  Marius M. Solomon,et al.  Partially dynamic vehicle routing—models and algorithms , 2002, J. Oper. Res. Soc..

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

[5]  Liping Fu,et al.  Scheduling dial-a-ride paratransit under time-varying, stochastic congestion , 2002 .

[6]  Gilbert Laporte,et al.  Waiting strategies for the dynamic pickup and delivery problem with time windows , 2004 .

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

[8]  Oli B. G. Madsen,et al.  A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives , 1995, Ann. Oper. Res..

[9]  Warren B. Powell,et al.  Stochastic and dynamic networks and routing , 1995 .

[10]  Jane Yung-jen Hsu,et al.  Dynamic vehicle routing using hybrid genetic algorithms , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

[11]  Michel Gendreau,et al.  Diversion Issues in Real-Time Vehicle Dispatching , 2000, Transp. Sci..

[12]  Mark E. T. Horn,et al.  Fleet scheduling and dispatching for demand-responsive passenger services , 2002 .

[13]  Giovanni Righini,et al.  Modelling and optimizing dynamical dial-a-ride problems , 2001 .

[14]  Maged M. Dessouky,et al.  Real-time scheduling rules for demand responsive transit systems , 1998, SMC'98 Conference Proceedings. 1998 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.98CH36218).

[15]  Gilbert Laporte,et al.  Double-horizon based heuristics for the dynamic pickup and delivery problem with time windows , 2004 .

[16]  Michel Gendreau,et al.  Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching , 1999, Transp. Sci..

[17]  Liping Fu Simulation Model for Evaluating Intelligent Paratransit Systems , 2001 .

[18]  Robert B. Dial,et al.  Autonomous dial-a-ride transit introductory overview , 1995 .

[19]  Liping Fu,et al.  Improving Paratransit Scheduling by Accounting for Dynamic and Stochastic Variations in Travel Time , 1999 .

[20]  Dusan Teodorovic,et al.  A fuzzy logic approach to dynamic Dial-A-Ride problem , 2000, Fuzzy Sets Syst..

[21]  N. H. M. Wilson,et al.  Simulation of a Computer Aided Routing System (CARS) , 1969 .

[22]  Martin W. P. Savelsbergh,et al.  Drive: Dynamic Routing of Independent Vehicles , 1998, Oper. Res..

[23]  Liping Fu,et al.  On‐Line and Off‐Line Routing and Scheduling of Dial‐a‐Ride Paratransit Vehicles , 1999 .

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

[25]  Maged Dessouky,et al.  A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows , 2004 .