Optimizing dedicated lanes and tolling schemes for connected and autonomous vehicles to address bottleneck congestion considering morning commuter departure choices
Bibliographic record
Abstract
The introduction of connected and autonomous vehicles (CAVs) provides a significant opportunity to address the persistently increasing problem of urban traffic congestion. By virtue of their connectivity and automation features, CAVs can reduce vehicle headways, thereby increasing road capacity and enhancing throughput. It has been hypothesized that CAV-infrastructure design policies can influence traveler behavior in ways that could reduce congestion. This research focuses on the potential of using CAV-dedicated lanes (CAVL) to alleviate traffic congestion in a bottleneck corridor that serves both human-driven vehicles (HDVs) and CAVs. We delve into investigating the impacts of CAVLs on the departure time and lane choices of morning commuters. The study first expresses traffic equilibrium conditions as a linear program with complementarity constraints. Then, a system-optimal commute congestion management design is formulated to minimize the overall system cost, which consists of queuing delays and early and late arrival costs. The results of the computational experiments suggest that: (i) the CAV technological advancements can significantly reduce traffic congestion under CAVL deployment with an almost similar effect as a tolling policy; and (ii) the lower value of time for CAV commuters leads them to depart closer to their desired arrival time without a tolling policy, which could significantly increase the bottleneck traffic congestion that commuters experience, particularly HDVs.
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.001 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| 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".