Bi-objective simulation optimization for online feedback control of variable speed limits considering uncertain traffic demands and compliance behaviours
Bibliographic record
Abstract
Abstract Variable speed limits (VSL) stands out as a well-established and effective strategy to alleviate traffic congestion and enhance traffic safety on motorways. It allows variable message signs (VMSs) to dynamically determine the speed limits according to real-time traffic states. This paper introduces an innovative online feedback control approach designed to regulate speed limit values on VMSs, addressing multiple bottlenecks while considering their spatiotemporal constraints. Moreover, we offline optimize the gain coefficients of this feedback control approach in the simulation-based optimization (SBO) framework. Specifically, with average and variance of space-mean speeds as bi-objectives, a stochastic SBO model considering uncertain traffic demands and compliance behaviours is established and solved by a bi-objective surrogate-based promising area search (BOSPAS) algorithm. Real-field experiments conducted in Edmonton, Canada, demonstrate the well-performing bi-objectives of the proposed approach, especially in handling uncertain compliance behaviours and traffic demands. Compared with the uncontrolled scenario, the feedback control schemes with the offline optimized gain coefficients improve the average and variance of space-mean speeds by up to 16.2% and 20.8%, respectively. Meanwhile, by the comparison of detailed performances, it is found that the optimized control schemes perform better than the uncontrolled scheme from the overall and local aspects. In conclusion, this study puts forward a general framework that applies an online feedback control approach with gain coefficients optimized offline by an SBO method to deal with real-time decision-making problems under uncertainties.
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.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.000 |
| 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".