Dynamic Allocation Model for Reversible Lanes in the Intelligent Vehicle Infrastructure Cooperative System
Bibliographic record
Abstract
The real-time dynamic control of reversible lanes is an effective measure to alleviate the traffic congestion caused by the directional imbalance of the traffic flow and improve the utilization rate of urban road resources. This paper proposes a dynamic allocation model for reversible lanes for road sections and intersections in the intelligent vehicle infrastructure cooperative system (IVICS). The dynamic lane allocation model for the road sections is constructed based on the Bureau of Public Road (BPR) function, in which the 24 hours of the day are divided into stages, the traffic volume and road impedance of each stage are obtained, and their product is integrated over time. Finally, the plan with the least delay in each stage is selected as the optimal solution. The dynamic lane control model for intersections is built according to the Highway Capacity Manual 2000 (HCM2000) delay model. With the minimum average delay of vehicles at the intersection as the objective function, the average delay of different lane combinations under different traffic conditions is analyzed to find the optimal combination of reversible lanes and ordinary lanes. The model is verified by case analysis and MATLAB calculations. The results show that the reversible lane dynamic control model can effectively allocate road resources and reduce driving delays.
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.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.001 | 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.003 | 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".