Capacity-Constrained Bus Bridging Optimization Framework
Bibliographic record
Abstract
Urban rail systems frequently suffer from unexpected service disruptions, which can result in severe delays and user dissatisfaction. “Bus bridging” is the strategy most commonly applied in responding to rail service interruptions in North America and Europe. Buses are pulled from regular routes and dispatched to serve as shuttles along the disrupted rail segment until regular train service is restored. In determining the required number of buses and source routes, most transit agencies rely on ad hoc approaches based on operational experience and constraints, which do not necessarily alleviate the extensive delays and queue build-ups at affected stations, nor do they minimize system-wide impacts in an optimal manner. This paper proposes a genetic algorithm-based optimization model to determine the optimal number of shuttle buses and route allocation to minimize overall subway- and bus rider delay for any given rail disruption incident. The generated optimal solutions were sensitive to bus-bay capacity constraints along the shuttle service corridor of any given disrupted subway segment, utilizing methods found in the Transit Capacity and Quality of Service Manual. The model was used in an analysis of real-world incident data obtained from the Toronto Transit Commission and supplemented by other passenger and travel time data. The bus bridging toolkit showed strong potential to produce efficient shuttle response plans that reduced the transit user delays by more than 50% while ensuring minimum queue formation at disrupted stations and maximizing the utilization of shuttle buses.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.002 | 0.001 |
| Insufficient payload (model declined to judge) | 0.008 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".