Optimal Slack Time for Schedule-Based Transit Operations
@article{Zhao2006OptimalST, title={Optimal Slack Time for Schedule-Based Transit Operations}, author={Jiamin Zhao and Maged M. Dessouky and Satish T. S. Bukkapatnam}, journal={Transp. Sci.}, year={2006}, volume={40}, pages={529-539} }
To improve service reliability, many transit agencies include significant amounts of slack in the schedule. However, too much slack in the schedule reduces service frequency, given a fixed vehicle fleet size. We study the problem of determining the optimal slack that minimizes the passengers' expected waiting times under schedule-based control. By applying a D/G/c queue model, we show that the system is stable if slack is added in the schedule. For a single-bus loop transit network, we derive…
142 Citations
Optimality conditions for public transport schedules with timepoint holding
- BusinessPublic Transp.
- 2009
It is shown that a timepoint’s optimal strictness increases with the demand for boardings at the timepoint, with the effect diminishing as stops become farther from the start of the route; however, welfare benefits compared to using a uniform percentage of slack across the route may be small.
Improving Bus Operations through Integrated Dynamic Holding Control and Schedule Optimization
- BusinessJournal of Advanced Transportation
- 2018
An optimization model is developed with passenger-orient objective function in terms of travel cost and constraints such as fleet size limit, layover time at terminals, and other schedule planning factors and shows that the proposed model significantly reduce passengers average travel time compared with existing methods.
Simulation model to find the slack time for schedule of the transit operations in off-peak time on the main terminal of massive transport system
- Business
- 2017
Public transit systems are designed to reduce traffic and time on the way people travel. In many stations it is probably to find high agglomeration of passengers, specially awaiting main routes. It…
Robust Network-Wide Bus Scheduling With Transfer Synchronizations
- BusinessIEEE Transactions on Intelligent Transportation Systems
- 2020
This study formulates the multi-line synchronization problem as a robust min(i)max problem that considers the fluctuations of the travel and dwell times of bus trips and introduces a flexible problem formulation that incorporates the constraint violations into the objective function.
Designing robust schedule coordination scheme for transit networks with safety control margins
- Business
- 2016
Improving Bus Service Reliability with Stochastic Optimization
- Computer Science2015 IEEE 18th International Conference on Intelligent Transportation Systems
- 2015
A bus headway balancer based on stochastic search and branch hopping/merging algorithm which optimizes schedules to minimize the EWT is proposed, which can be applied off line or in real-time.
A schedule-based coordinated optimization model for Transit Signal Priority under Connected Vehicle environment
- Computer Science17th International IEEE Conference on Intelligent Transportation Systems (ITSC)
- 2014
A coordinated optimization model for Transit Signal Priority (TSP) under the environment of Connected Vehicle is presented, where the model focuses on the dedicated bus lane, and the control unit is between two successive bus stops, including all the intersections between them.
Real-Time Hybrid In-Station Bus Dispatching Strategy Based on Mixed Integer Programming
- BusinessInf.
- 2016
A mixed integer programming model, integrating a bus-holding and stop-skipping strategy, is constructed to improve transit service with a minimum cost and shows that compared to a single control strategy, the proposed hybrid model is a better trade-off between the quality of the transit service and the operation cost.
A real-time bus dispatching policy to minimize passenger wait on a high frequency route
- Business
- 2015
Bus scheduling considering trip‐varying travel times, vehicle availability and capacity
- Business
- 2020
The author proposes an improved formulation of the bus scheduling problem that considers the vehicle availability, the vehicle capacity and the allowed headway variability among successive trip dispatches, which expands the classic bus scheduling model formulation by including the aforementioned features.
References
SHOWING 1-10 OF 27 REFERENCES
Control Strategies for an Idealized Public Transportation System
- Business
- 1972
Vehicles load passengers at a single service point and, after traversing some route, return for another trip. The travel times of successive trips are independent identically distributed random…
A MODEL FOR INVESTIGATING THE EFFECTS OF SERVICE FREQUENCY AND RELIABILITY ON BUS PASSENGER WAITING TIMES
- Business
- 1978
A model of bus and passenger arrivals at a bus stop is proposed. Passengers are considered to be either random arrivals or non-random arrivals whose time of arrival is planned so as to insure a given…
Distributed architecture for real-time coordination of bus holding in transit networks
- Computer ScienceIEEE Trans. Intell. Transp. Syst.
- 2003
A distributed control approach based on multiagent negotiation is presented, wherein stops and buses act as agents that communicate in real-time to achieve dynamic coordination of bus dispatching at…
Bus dispatching at timed transfer transit stations using bus tracking technology
- Computer Science
- 1999
On Controlling Randomness in Transit Operations
- Mathematics
- 1974
In many transit systems, vehicles depart their originating stops at fixed intervals, but headways become increasingly irregular as they move along the line. This paper considers how best to control…
Control of Pairing of Vehicles on a Public Transportation Route, Two Vehicles, One Control Point
- Mathematics
- 1974
If the time required for a vehicle (particularly buses or elevators) to load passengers is an increasing function of the number of passengers loaded, then, on a route served by more than one vehicle,…
The theory of queues with a single server
- Mathematics
- 1952
This paper gives a development in the case where there is a single queue and a single server attending to it; the theory of multiple queues or many servers seems to be a problem of considerable difficulty.