Traffic Prediction and Optimization at Signalized Intersections with Connected Vehicles A Hybrid Approach
Bibliographic record
Abstract
With the evolution of Connected Vehicle (CV) technology, the exploration of CV-enabled traffic control systems emerges as a novel strategy to address urban traffic congestion and enhance the operational efficiency of signalized intersections. In a mixed traffic environment comprising both CVs and non-CVs, leveraging multi-resolution CV data for more precise prediction of future traffic conditions has become a critical factor in improving the effectiveness of traffic control systems. This thesis proposes a novel hybrid approach that seamlessly integrates traditional traffic flow models with deep learning techniques to predict and optimize traffic at signalized intersections with CVs. The proposed method first utilizes a Long Short-Term Memory (LSTM) Neural Network model based on CV data to predict the in-flow rates at intersections. Subsequently, a shockwave theory is applied to the predicted in-flow rates for accurate queue profile prediction. Finally, a signal optimization algorithm is developed to search for optimal phase sequences and durations within a forward time window to minimize vehicle delay. The simulation platforms are built for both a virtual and a real-world intersection, respectively, to evaluate the effectiveness of this hybrid approach in predicting queue profiles and optimizing signal timings. The results demonstrate that the proposed hybrid model performs well in predicting total delay at intersections under various market penetration rates (MPRs) of CVs and traffic demand levels. Furthermore, in a comparative analysis with the actuated control and fixed-time control, the proposed control algorithm is proven to outperform them significantly under medium and high demand levels. Under low demand levels, the proposed control algorithm has effectiveness similar to the actuated control but remains superior to the fixed-time control. Additionally, the results indicate that the effectiveness of this algorithm improves with higher MPRs and is still better than that of the actuated control, even under lower MPRs.
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.001 |
| 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.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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".