Differential variable speed limits to improve performance and safety of car-truck mixed traffic on freeways
Bibliographic record
Abstract
This study develops a differential variable speed limit (DVSL) which assigns different speed limits for car and truck, and varies speed limits based on traffic conditions. The proposed DVSL algorithm changes speed limits in real time based on truck percentage and occupancy immediately upstream of the ramp and the average speed of the control road sections upstream of the ramp. DVSL algorithm also considers spatial coordination of speeds, which gradually changes the speed limits in successive road sections upstream of the ramp when the severe congestion occurs. The study tested the impacts of DVSL and three other speed limit strategies on delay and safety for a section of the Gardiner Expressway in Toronto, Canada using the VISSIM traffic simulation model. The other strategies are 1) uniform speed limit (USL), 2) differential speed limit for car and truck (DSL), and 3) USL & DSL (U&D) – i.e., USL at low truck percentage and DSL at high truck percentage. It was found that DVSL showed the lowest delays for both car and truck among the four strategies. This is mainly because DVSL increased the spacing between vehicles in the right lane upstream of the on-ramp and facilitated vehicles' merging into the mainline freeway. It was also found that DVSL showed the lowest likelihood of rear-end crash between the lead and following vehicles among the four strategies. This study demonstrates that the proposed DVSL algorithm can better control car and truck speeds to reduce delay and improve safety of car-truck mixed traffic flow on freeways.
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.000 |
| 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".