Optimum Equilibrium Passenger Flow Control Strategies with Delay Penalty Functions under Oversaturated Condition on Urban Rail Transit
Bibliographic record
Abstract
When passengers are oversaturated in the urban rail transit system and a further increase of train frequency is impossible, passenger flow control strategy is an indispensable approach to avoid congestion and ensure safety. To make the best use of train capacity and reduce the passenger waiting time, coordinative flow control is necessary at each station on a line. In most published studies, the equilibrium of passenger distributions among different stations and periods is not considered. As a result, two issues occur making it hard to implement in practical. First, a large number of passengers are held up outside a small number of stations for very long time. Second, there is a large variation of controlled flows for successive time intervals. To alleviate this problem, a single-line equilibrium passenger flow control model is constructed, which minimizes the total passenger delay. By applying different forms of the delay penalty function (constant and linear), flow control strategies such as independent flow control and equilibrium flow control can be reproduced. An improved simulated annealing algorithm is proposed to solve the model. A numerical case is studied to analyze the sensitivity of the functions, and the best parameter relationship in different functions could be confirmed. A real-world case from Batong Line corridor in Beijing subway is used to test the applicability of the model and algorithm, and the result shows that the solution with linear delay penalty functions can not only reduce the total passenger delay but also equilibrate the number of flow control passengers on spatial and temporal.
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.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.002 |
| 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".