Improving Bus Passenger Transfers on Road Segments through Online Operational Tactics

The use of transfers in public transit has the advantages of reducing operational costs and introducing more flexible, efficient route planning. The main drawback from the passengers’ point of view is the inconvenience of traveling multilegged trips. To diminish the waiting time caused by passenger transfers, synchronized timetables were introduced. The use of these timed transfers, however, creates uncertainty about the simultaneous arrival of two (or more) buses at an existing stop, which can lead to a deterioration in system reliability. To alleviate this uncertainty about simultaneous arrivals, a new passenger transfer concept was developed that extends the commonly used single-point encounter (at a single transit stop) to a road segment encounter (with any point along the road segment constituting a possible encounter point). The objectives of this work are as follows: (a) to define the bus-encounter probability along a road segment, (b) to introduce a simulation model to estimate the bus-encounter probability, (c) to model the bus-encounter probability upper bound, which is a major input to a dynamic programming model that optimizes the total travel time, and (d) to present simulation results that confirm the benefits of such a system. It is believed that the proposed concept will reduce the uncertainty of two buses meeting at a point, as well as reduce the average travel time and enable more flexibility in deploying online operational tactics (e.g., holding buses, skipping stops, slowing down).

[1]  A. Unwin The Art and Theory of Dynamic Programming , 1979 .

[2]  Clifford A. Shaffer,et al.  Exact Computation of 2-d intersections , 1992, Graphics Gems III.

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

[4]  J. Wolfowitz,et al.  An Introduction to the Theory of Statistics , 1951, Nature.

[5]  Lazar N Spasovic,et al.  Evaluation of Feeder Bus Systems with Probabilistic Time-Varying Demands and Nonadditive Time Costs , 2001 .

[6]  Mark E.T. Horn,et al.  Procedures for planning multi-leg journeys with fixed-route and demand-responsive passenger transport services , 2004 .

[7]  Gilbert Laporte,et al.  STOCHASTIC VEHICLE ROUTING. , 1996 .

[8]  Franklin A. Graybill,et al.  Introduction to the Theory of Statistics, 3rd ed. , 1974 .

[9]  Nigel H. M. Wilson,et al.  Bus network design , 1986 .

[10]  Avishai Ceder Designing Public Transport Networks and Routes , 2002 .

[11]  Maged Dessouky,et al.  REAL-TIME CONTROL OF BUSES FOR SCHEDULE COORDINATION AT A TERMINAL , 2003 .

[12]  Boaz Golany,et al.  Creating bus timetables with maximal synchronization , 2001 .

[13]  Roberto Musmanno,et al.  Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies , 2003, Eur. J. Oper. Res..

[14]  Averill M. Law,et al.  Simulation Modeling and Analysis , 1982 .

[15]  Cynthia Barnhart,et al.  Transportation Service Network Design: Models and Algorithms , 1999 .

[16]  Jonathan Levine,et al.  Impacts of an Advanced Public Transportation System Demonstration Project , 2000 .

[17]  P Bakker LARGE SCALE DEMAND RESPONSIVE TRANSIT SYSTEMS - A LOCAL SUBURBAN TRANSPORT SOLUTION FOR THE NEXT MILLENNIUM , 1999 .

[18]  Randolph W. Hall,et al.  Bus dispatching at timed transfer transit stations using bus tracking technology , 1999 .