Abstract
Traditional bus bunching control methods (e.g., adding slack to schedules, adapting cruising speed), in one way or another, trade commercial speed for better system stability and, as a result, may impose the burden of additional travel time on passengers. Recently, a dynamic bus substitution strategy, where standby buses are dispatched to take over service from late/early buses, was proposed as an attempt to enhance system reliability without sacrificing too much passenger experience. This paper further studies this substitution strategy in the context of multiple bus lines under either time-independent or time-varying settings. In the latter scenario, the fleet of standby buses can be dynamically utilized to save on opportunity costs. We model the agency’s substitution decisions and retired bus repositioning decisions as a stochastic dynamic program so as to obtain the optimal policy that minimizes the system-wide costs. Numerical results show that the dynamic substitution strategy can benefit from the “economies of scale” by pooling the standby fleet across lines, and there are also benefits from dynamic fleet management when transit demand varies over time. Numerical examples are presented to illustrate the applicability and advantage of the proposed strategy. The substitution strategy not only holds the promise to outperform traditional holding methods in terms of reducing passenger costs, they also can be used to complement other methods to better control very unstable systems.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.