A Two-Layer Network Dynamic Congestion Pricing Based on Macroscopic Fundamental Diagram
Bibliographic record
Abstract
Dynamic congestion pricing has attracted increasing attentions during the recent years. Nevertheless, limited research has been conducted to address the dynamic tolling scheme at the network level, such as to cooperatively manage two alternative networks with heterogeneous properties, e.g., the two-layer network consisting of both expressway and arterial network in the urban areas. Recently, the macroscopic fundamental diagram (MFD) developed by both field experiments and simulation tests illustrates a unimodal low-scatter relationship between the mean flow and density network widely, providing the network traffic state is roughly homogeneous. It reveals traffic flow properties at an aggregated level and sheds light on dynamic traffic management of a large network. This paper proposes a bilevel programming toll model, incorporating MFD to solve the unbalanced flow distribution problem within the two-layer transportation networks. The upper level model aims at minimizing the total travel time, while the lower level focuses on the MFD-based traffic assignment, which extends the link-based traffic assignment to network wide level. Genetic algorithm (GA) and the method of successive average were adopted for solving the proposed model, on which an online experimental platform was established using VISSIM, MATLAB, and Visual Studio software packages. The results of numerical studies demonstrate that the total travel time is decreased by imposing the dynamic toll, while the total travel time savings significantly outweigh the toll paid. Consequently, the proposed dynamic toll scheme is believed to be effective from both traffic and economic points of view.
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.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.000 | 0.001 |
| 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.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".