An Overlapping Phase Approach to Optimize Bus Signal Priority Control under Two-Way Signal Coordination on Urban Arterials
Bibliographic record
Abstract
With the consideration of the uneven traffic volume distribution at intersections on urban arterials, this paper aims to minimize the overall passenger delay (buses and private vehicles) at intersections and identify the applicable conditions of the proposed method with field data. The overlapping phase-based signal control logic and the bus priority control algorithm under two-way signal coordination on arterial roads are proposed. The vehicular capacities and occupancies for buses and passenger cars are considered in the evaluation of the method performance. A field test was carried out at two major intersections on an arterial road in Hefei, China. With the test data, the proposed method is examined and the possible influencing factors are analyzed for identifying the corresponding applicable conditions. The analysis result shows that the application of the overlapping phase helps to provide a relatively flexible signal control for the varying traffic demands at intersections. Compared to the conventional phase, it isof more practical significance to consider overlapping phase and apply bussignal priority control under two-way signal coordination according to the condition of uneven traffic volumedistribution at intersections on urban arterials. The proposed method can effectively decrease the total passenger delay at the intersections on urban arterials under certain applicable conditions. The possible factors influencing the method applicability are identified as well. It is verified that bus signal priority control under the two-way signal coordination, based on overlapping phases, is more conducive to improving traffic efficiency on urban arterials. Regarding the influencing factors and the applicability of the proposed method, the results show that not all situations are conducive to decreasing passenger delay at intersections. The proposed method should be applied under certain applicable conditions and principles in order to efficiently and effectively improve the traffic efficiency on arterial roads.
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.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.002 | 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".