Automated Traffic State Optimization in the Weaving Area of Urban Expressways by a Reinforcement Learning-Based Cooperative Method of Channelization and Ramp Metering
Bibliographic record
Abstract
The traffic congestion problem on urban expressways, especially in the weaving areas, has become severe. Some cooperative methods have been proven to be more effective than a separate approach in optimizing the traffic state in weaving areas on urban expressways. However, a cooperative method that combines channelization with ramp metering has not been presented and its effectiveness has not been examined yet. Thus, to fill this research gap, this study proposes a reinforcement learning-based cooperative method of channelization and ramp metering to achieve automated traffic state optimization in the weaving area. This study uses an unmanned aerial vehicle to collect the real traffic flow data, and four control strategies (i.e., two kinds of channelization methods, a ramp metering method, and a cooperative method of channelization and ramp metering) and a baseline (without controls) are designed in the simulation platform (Simulation of Urban Mobility). The speed distributions of different control strategies on each lane were obtained and analyzed in this study. The results show that the cooperative method of channelization and ramp metering is superior to other methods, with significantly higher increases in vehicle speeds. This cooperative method can increase the average vehicle speeds in lane-1, lane-2, and lane-3 by 14.51%, 14.81%, and 37.03%, respectively. Findings in this study can contribute to the improvement of traffic efficiency and safety in the weaving area of urban expressways.
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".