Path-Based Progression Optimization Model for Multimodal Traffic System Signal Coordination
Bibliographic record
Abstract
Passive transit signal priority (TSP) strategies are widely recognized as effective tools for mitigating bus delays along urban arterials. However, existing TSP models primarily focus on through movements of transit vehicles, leading to potential delays for buses making turning movements. Moreover, these models do not adequately address signal coordination in multi-modal traffic systems involving both buses and private vehicles, resulting in increased delays and frequent stops for private vehicles. To address these limitations, this study proposes a binary mixed-integer linear programming (BMILP)-based signal progression band optimization model designed for multi-modal, path-level signal coordination. The model creates multiple progression bands for both straight and turning buses to minimize potential transit delays and enhance public transport service levels. By incorporating the mutual interactions between buses and private vehicles, progression bands for private vehicles are simultaneously optimized, enabling coordinated signal control that considers all users. The objective function maximizes passenger-equivalent service demand satisfied by the progression bands, explicitly accounting for mixed traffic flows and passenger loads. Numerical experiments on an urban arterial corridor demonstrate that, compared with the benchmark BUSBAND method, the proposed model achieves a 26% reduction in average bus delays, a 37% reduction in passenger car delays, and a 22% decrease in total stops, while also improving overall travel time reliability.
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.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| 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.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.006 | 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".