Approximating Dynamic Equilibrium Analysis in Multi-Region Network Based on Macroscopic Fundamental Diagram
Bibliographic record
Abstract
Modeling and control of road traffic in large-scale urban networks present considerable challenges. The traffic equilibrium phenomena, with the question of route choice behavior in case of heterogeneous urban networks, has not been thoroughly investigated in parsimonious and classical models due to the limitation, like large network size, spatiotemporal propagation of congestion, and the interaction between driver decisions, etc. In this paper, we propose a bi-level approximating dynamic equilibrium model (BLADEM) for the approximating dynamic equilibrium analysis in multi-region network based on macroscopic fundamental diagram (MFD). The proposed model combines the region-based model and the internal-region model. With the information from region MFD, the region-based model is used to implement the time-dependent regional route choice estimation. Traffic equilibrium condition (dynamic user equilibrium, DUE) is considered in an internal-region model with time-aggregated regional OD demand from the region level. Furthermore, the complexity of the proposed model is derived. Then, the comparative analysis of the algorithm complexity between the proposed model and the DUE model is given. The proposed model is evaluated based on the high-resolution vehicle trajectory data (or connected vehicles trajectory data) from the DiDi platform collected in Chengdu, China with more than 3,000,000 GPS points during a typical workday. The evaluation results show that the proposed model can obtain the approximating traffic dynamics compared with the DUE algorithm. Pleasantly, the improved calculation efficiency is between 21% and 42%. The results indicate the promising potential of using the proposed model to analyze approximating dynamic equilibrium in the multi-region heterogeneous network.
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.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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".