Improving Traffic State Prediction Model for Variable Speed Limit Control by Introducing Stochastic Supply and Demand
Bibliographic record
Abstract
Variable speed limit (VSL) is becoming recognized as an effective way to improve traffic throughput and road safety. In particular, methods based on traffic state prediction exhibit promising potential to prevent future traffic congestion and collisions. However, field observations indicate that the traffic state prediction model results in nonnegligible error that impacts the next step decision making of VSL. Thus, this paper investigates how to eliminate this prediction error within a VSL environment. In this study, the traffic state prediction model is a second-order traffic flow model named METANET, while the VSL control is model predictive control (MPC) based, and the VSL decision is discrete optimized choice. A simplified version of the switching mode stochastic cell transmission model (SCTM) is integrated with the METANET model to eliminate the prediction error. The performance of the proposed method is assessed using field data from a VSL pilot test in Edmonton, Canada, and is compared with the prediction results of the baseline METANET model during the road test. The results show that during the most congested period the proposed SCTM-METANET model significantly improves the prediction accuracy of regular METANET model.
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.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| 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".