Optimal Bus-Bridging Service under a Metro Station Disruption
Bibliographic record
Abstract
A station disruption is an abnormal operational situation that the entrance or exit gates of a metro station have to be closed for a certain of time due to an unexpected incident. The passengers’ travel behavioral responses to the alternative station disruption scenarios and the corresponding controlling strategies are complex and hard to capture. This can lead to the hardness of estimating the changes of the network-wide passenger demand, which is the basis of carrying out a response plan. This paper will establish a model to solve the metro station disruption problem by providing optimal additional bus-bridging services. Two main contributions are made: (1) a three-layer discrete choice behavior model is developed to analyze the dynamic passenger flow demand under station disruption; and (2) an integrated algorithm is designed to manage and control the station disruption crisis by providing additional bus-bridging services with the objective of minimizing the total travel time of affected passengers and the operating cost of bridging-buses. Besides, the multimodal transport modes, including metro, bridging-bus, shared-bike, and taxi, are considered as passengers’ alternative choices in face of the station disruption. A numerical study based on the Beijing metro network shows that additional bus-bridging services can significantly eliminate the negative impact of the station disruption.
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.002 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 0.002 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.002 | 0.001 |
| Insufficient payload (model declined to judge) | 0.004 | 0.000 |
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".