Shortest-Way: An Improved Empirical Transition Method for Signal Coordination
Bibliographic record
Abstract
Four fundamental insights into transition methods are provided from the perspective of traffic engineers. An improved empirical transition method (i.e., Shortest-way) is developed with the goal of reducing the time spent on offset correction and the offset deviations of the coordinated phases during the transition period. Shortest-way operates stepwise and can be activated to correct offset at the scheduled time to switch plans. The maximum amount of adjustment that can be made to a transition cycle length is calculated based on the timing parameters of active phases in the old and new plans. The problem of cycle length distribution is formulated as a nonlinear integer programming problem, aiming at minimizing the sum of the squares of the intersection offset deviations of all the transition cycles. The portion of the cycle length that can be allocated to each phase in a transition cycle is calculated based on its splits in the old and new plans and its potential contribution to the maximum amount of adjustment to the cycle length. The numerical experimental results proved the potential advantage of Shortest-way over CORSIM Shortway and justified the necessity for managing the time to switch plans at the intersection level.
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.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".