Optimization Method for Transit Signal Priority considering Multirequest under Connected Vehicle Environment
Bibliographic record
Abstract
Aiming at reducing per person delay, this paper presents an optimization method for Transit Signal Priority (TSP) considering multirequest under connected vehicle environment, which is based on the travel time prediction model. Conventional arrival time of transit depended on the detection information and the front road state, which restricted the effect of priority seriously. According to the bidirectional and real-time information transmission under connected vehicle environment, this paper establishes a more accurate forecasting model of bus travel time. Based on minimizing the total person delay at the intersection, the decision mechanism of multirequest is devised to meet the priority needs of buses with different arrival times. And the green time compensation algorithm is developed after considering the arrival information of the buses in the next cycle of compensational phase. Finally, the paper combines the COM interface of VISSIM and Matlab to achieve the proposed method under connected vehicle environment. Four control methods were tested when the VCR was 0.5, 0.7, and 0.9. The results illustrated that the proposed method reduced per person delay by 18.57%, 11.88%, and 18.96% and decreased the private vehicle delay by 3.73%, 7.62%, and 13.10%, respectively.
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.000 |
| Science and technology studies | 0.001 | 0.000 |
| 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.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".