A stochastic programming model for designing bus bridging services under metro disruptions

Abstract

With the growing reliance on urban metro networks, any accidental disruption can lead to rapid degradation and significant economic losses. Bus bridging services are common and efficient ways to minimize such adverse impacts. In this study, we investigate the problem of designing bus bridging services in response to unexpected metro disruptions, and propose a routing strategy with multiple bridging routes. In particular, to respond to uncertain factors such as passenger arrivals and bus travel times in the disruption environment, we develop a two-stage stochastic programming model for the collaborative optimization of bus bridging routes, schedules, and passenger assignments. To solve the computational challenges arising with the proposed model, a tailored tabu search algorithm is developed. Finally, several sets of numerical experiments are conducted and experimental results reveal that our proposed routing strategy can effectively improve the service level for the affected passengers during metro disruptions.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 10 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.