Proactive Ramp Management under the Threat of Freeway-Flow Breakdown
Bibliographic record
Abstract
Ramp metering is a frequently applied method to improve traffic flow performance in congested freeway systems. There is a great variety of control algorithms to decide on red times of ramp metering signals. Based on current research results about the probability of flow-breakdown on freeway segments, a new approach for ramp metering strategies was developed. It is based on the idea of a network-wide consistent probability for a flow breakdown. This idea has been actualized for various popular ramp metering concepts. For two real-world cases, one from Minneapolis and the other from Toronto, new ramp metering algorithms have been formulated in detail based on traffic flow data from these freeways. To test the effects of these modified algorithms, microscopic simulation by VISSIM was applied. It was possible to represent traffic flow with the currently applied metering concept, and with the use of the new probability-based concepts. Simulation runs over 5 to 6 hours of traffic flow, including the decisive peak hours, have been performed. The results showed that the new algorithms were able to improve the overall performance of the freeway systems concerned. The method was able to postpone the beginning of breakdown, reduce the duration of congested periods, and, thus, reduce the total amount of travel time for drivers. Therefore, the concept of probability based ramp metering algorithms appears to be a useful tool to achieve balanced ramp metering strategies for congested freeway systems.
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".