Machine Learning Advancements in Urban Traffic Simulation: A Comprehensive Survey
Bibliographic record
Abstract
Urban traffic simulation is useful in many ways to understand, manage, and predict the growing complexities of traffic dynamics within a city. Traditional simulation models often struggle to capture the intricacies of urban traffic patterns, leading to unrealistic simulations, which negatively affect traffic management and urban planning. In recent years, Machine Learning solutions have emerged to enhance various aspects of urban traffic simulation, which is possible by utilizing vast amounts of data and extracting valuable insights. This survey systematically reviews the state-of-the-art Machine Learning techniques applied to urban traffic simulation. By focusing on the practical application of Machine Learning techniques in various studies, we aim to analyze the current research direction, highlight the effectiveness of existing approaches, identify their limitations, and propose potential strategies to improve the performance and applicability of these techniques in real-world scenarios. Another key contribution of this survey is a proof-of-concept case study, which utilizes a basic Reinforcement Learning algorithm to control traffic lights across multiple intersections. The results from this case study demonstrate a significant improvement in vehicle wait time compared to the static baseline method. The code developed for this case study is publicly available, providing a valuable resource for researchers interested in replicating this work or building upon it. This survey aims to bridge the gap between simulation and reality by providing a comprehensive foundational understanding of the subject, critically evaluating the existing limitations in current methodologies, and suggesting future directions to improve performance, adaptability, and usability.
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.003 | 0.010 |
| Meta-epidemiology (narrow) | 0.002 | 0.001 |
| Meta-epidemiology (broad) | 0.002 | 0.002 |
| Bibliometrics | 0.004 | 0.007 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.003 | 0.004 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.002 | 0.003 |
| Insufficient payload (model declined to judge) | 0.003 | 0.002 |
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".