A model for the fleet sizing of demand responsive transportation services with time windows

We study the problem of determining the number of vehicles needed to provide a demand responsive transit service with a predetermined quality for the user in terms of waiting time at the stops and maximum allowed detour. We propose a probabilistic model that requires only the knowledge of the distribution of the demand over the service area and the quality of the service in terms of time windows associated of pickup and delivery nodes. This methodology can be much more effective and straightforward compared to a simulation approach whenever detailed data on demand patterns are not available. Computational results under a fairly broad range of test problems show that our model can provide an estimation of the required size of the fleet in several different scenarios.

[1]  C. Daganzo.  Checkpoint dial-a-ride systems , 1984 .

[2]  Nigel H. M. Wilson,et al.  ANALYTIC MODEL FOR PREDICTING DIAL-A-RIDE SYSTEM PERFORMANCE , 1974 .

[3]  J. M. D. Castillo,et al.  A heuristic for the traveling salesman problem based on a continuous approximation , 1999 .

[4]  Carlos F. Daganzo,et al.  Design of multiple-vehicle delivery tours--I a ring-radial network , 1986 .

[5]  S K Jason Chang,et al.  WELFARE COMPARISON OF FIXED- AND FLEXIBLE-ROUTE BUS SYSTEMS , 1993 .

[6]  Martin W. P. Savelsbergh,et al.  The General Pickup and Delivery Problem , 1995, Transp. Sci..

[7]  Carlos F. Daganzo.  MODELING DISTRIBUTION PROBLEMS WITH TIME WINDOWS , 1985 .

[8]  Ian Hodder,et al.  Simulation studies in archaeology , 1980 .

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

[10]  André Langevin,et al.  Design of multiple-vehicle delivery tours satisfying time constraints , 1989 .

[11]  David M. Stein,et al.  Scheduling Dial-a-Ride Transportation Systems , 1978 .

[12]  Randolph W. Hall,et al.  Performance and Design of Mobility Allowance Shuttle Transit Services: Bounds on the Maximum Longitudinal Velocity , 2006, Transp. Sci..

[13]  André Langevin,et al.  CONTINUOUS APPROXIMATIONA MODELS IN FREIGHT DISTRIBUTION: AN OVERVIEW , 1996 .

[14]  David M. Stein,et al.  An Asymptotic, Probabilistic Analysis of a Routing Problem , 1978, Math. Oper. Res..

[15]  J. Beardwood,et al.  The shortest path through many points , 1959, Mathematical Proceedings of the Cambridge Philosophical Society.

[16]  Olusegun Adebisi,et al.  COMPARING FIXED-ROUTE AND FLEXIBLE-ROUTE STRATEGIES FOR INTRAURBAN BUS TRANSIT , 1982 .

[17]  Paul M. Schonfeld,et al.  Optimization Models for Comparing Conventional and Subscription Bus Feeder Services , 1991, Transp. Sci..

[18]  Carlos F. Daganzo,et al.  Logistics Systems Analysis , 1991 .

[19]  Randolph W. Hall,et al.  NETWORK DESIGN FOR A GRID HYBRID TRANSIT SERVICE , 2004 .

[20]  Nicos Christofides,et al.  EXPECTED DISTANCES IN DISTRIBUTION PROBLEMS , 1969 .

[21]  H. Kunzi,et al.  Lectu re Notes in Economics and Mathematical Systems , 1975 .

[22]  Reginald R. Souleyrette,et al.  Implementing Vehicle Routing Models , 1990 .

[23]  Carlos F. Daganzo,et al.  An approximate analytic model of many-to-many demand responsive transportation systems , 1978 .

[24]  James H Batchelder,et al.  ANALYSIS OF INTEGRATED URBAN PUBLIC TRANSPORTATION SYSTEMS , 1977 .

[25]  Nicos Christofides,et al.  Distribution management : mathematical modelling and practical analysis , 1971 .

[26]  Nigel H. M. Wilson,et al.  PERFORMANCE MODELS OF FLEXIBLY ROUTED TRANSPORTATION SERVICES , 1980 .

[27]  Maged Dessouky,et al.  Impacts of management practices and advanced technologies on demand responsive transit systems , 2004 .

[28]  Maged Dessouky,et al.  A simulation study of demand responsive transit system design , 2008 .

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

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

[31]  Carlos F. Daganzo,et al.  The length of tours in zones of different shapes , 1984 .

[32]  Carlos F. Daganzo,et al.  The Distance Traveled to Visit N Points with a Maximum of C Stops per Vehicle: An Analytic Model and an Application , 1984, Transp. Sci..

[33]  Douglas M Medville,et al.  DEMAND, SUPPLY, AND COST MODELLING FRAMEWORK FOR DEMAND-RESPONSIVE TRANSPORTATION SYSTEMS , 1974 .

[34]  Randolph W. Hall.  Pickup and Delivery Systems For Overnight Carriers , 1992 .

[35]  Carlos F. Daganzo,et al.  Modeling Distribution Problems with Time Windows: Part I , 1987, Transp. Sci..

[36]  D E Ward.  A THEORETICAL COMPARISON OF FIXED ROUTE BUS AND FLEXIBLE ROUTE SUBSCRIPTION BUS FEEDER SERVICE IN LOW DENSITY AREAS , 1975 .

[37]  Jacques Desrosiers,et al.  VRP with Pickup and Delivery , 2000, The Vehicle Routing Problem.

[38]  Roy E. Lave,et al.  A Handbook for Acquiring Demand-Responsive Transit Software , 1996 .

[39]  Richard C. Larson,et al.  Urban Operations Research , 1981 .