Managing Recurrent Congestion of Subway Network in Peak Hours with Station Inflow Control
Bibliographic record
Abstract
Station inflow control (SIC) is an important and effective method for reducing recurrent congestion during peak hours in the Beijing, Shanghai, and Guangzhou subway systems. This work proposes a practical and efficient method for establishing a static SIC scheme in normal weekdays for large-scale subway networks. First, a traffic assignment model without capacity constraint is utilized to determine passenger flow distributions on the network. An internal relationship between station inflows and section flows is then constructed. Second, capacity bottlenecks are identified by considering the transport capacity of each section. Then, a feedback-based bottleneck elimination strategy is established to search target control stations and determine their control time and control strength. To validate the effectiveness of the proposed approach, a decision support system coded in the C# programming language was developed, and the Beijing subway was used as a case study. The results indicate that the proposed method and tool are capable of practical applications, and the generated SIC plan has better performance over the existing SIC plan. This study provides a practical and useful method for operation agencies to construct SIC schemes in the subway system.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 teacher head, 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".