Designing the master schedule for demand-adaptive transit systems

Demand-Adaptive Systems (DASs) display features of both traditional fixed-line bus services and purely on-demand systems such as dial-a-ride, that is, they offer demand-responsive services within the framework of traditional scheduled bus transportation. A DAS bus line serves a given set of compulsory stops according to a predefined schedule, which specifies the time windows associated with each stop, and thus provides the traditional use of a transit line without reservation. On the other hand, passengers may issue requests for transportation between two optional stops, inducing detours in the vehicle routes. The design of a DAS line is a complex planning process that requires to select the compulsory stops and to determine its master schedule in terms of the time windows associated with the compulsory stops. In this paper, we focus on determining the master schedule for a single DAS line. We propose a mathematical description and a solution method based on probabilistic approximations of several DAS line core characteristics. Results of numerical experiments are also given and analyzed.

[1]  David Koffman,et al.  Operational Experiences with Flexible Transit Services , 2004 .

[2]  Arthur E. McGarity,et al.  Design And Operation Of Civil And Environmental Engineering Systems , 1997 .

[3]  Jacques Desrosiers,et al.  A Request Clustering Algorithm for Door-to-Door Handicapped Transportation , 1991, Transp. Sci..

[4]  Carl Henrik Häll,et al.  A Framework for Evaluation and Design of an Integrated Public Transport System , 2006 .

[5]  Kelly Blume,et al.  A Method for Scheduling Integrated Transit Service , 2000 .

[6]  Guy Desaulniers,et al.  Chapter 2 Public Transit , 2007, Transportation.

[7]  Richard F. Hartl,et al.  A survey on pickup and delivery problems , 2008 .

[8]  Luca Quadrifoglio,et al.  An insertion heuristic for scheduling Mobility Allowance Shuttle Transit (MAST) services , 2007, J. Sched..

[9]  Teodor Gabriel Crainic,et al.  Flexible many-to-few + few-to-many = an almost personalized transit system , 2001 .

[10]  Mark Hickman,et al.  Modeling Cost and Passenger Level of Service for Integrated Transit Service , 2001 .

[11]  Federico Malucelli,et al.  Demand Adaptive Systems: Some Proposals on Flexible Transit1 , 1999 .

[12]  Teodor Gabriel Crainic,et al.  Meta-Heuristics for a Class of Demand-Responsive Transit Systems , 2005, INFORMS J. Comput..

[13]  Teodor Gabriel Crainic,et al.  Adaptive memory programming for a class of demand responsive transit systems , 2001 .

[14]  Paolo Toth,et al.  Fast Local Search Algorithms for the Handicapped Persons Transportation Problem , 1996 .

[15]  Sophie N. Parragh,et al.  A survey on pickup and delivery models Part II : Transportation between pickup and delivery locations , 2007 .

[16]  Gilbert Laporte,et al.  The Dial-a-Ride Problem (DARP): Variants, modeling issues and algorithms , 2003, 4OR.

[17]  M.E.T Horn,et al.  Multi-modal and demand-responsive passenger transport systems: a modelling framework with embedded control systems , 2002 .

[18]  Paolo Toth,et al.  Exact solution of large-scale, asymmetric traveling salesman problems , 1995, TOMS.

[19]  Teodor Gabriel Crainic,et al.  A DEMAND RESPONSIVE FEEDER BUS SYSTEM , 2000 .