Optimizing Urban Travel Time Using Genetic Algorithms for Intelligent Transportation Systems
Bibliographic record
Abstract
Urban congestion causes further increases in travel times, fuel consumption and greenhouse-gas emissions. In this regard, we conduct a systematic study of a Genetic Algorithm (GA) for real-time routing in an urban scenario in Bethlehem City, based on a SUMO microsimulation that has been calibrated using real data from the field. Our work makes four main contributions: (i) the implementation of a reproducible GA framework for dynamic routing with explicit constraints and adaptive termination criterion; (ii) design of a weight sensitivity study for studying a multi term fitness function with travel time and waiting time, and optionally fuel usage; (iii) an edge-assisted distributed architecture on roadside units (RSUs) supported by cloud services; and (iv) specifying and refining the data set description and experimental protocol with a planned statistical analysis. Empirical evidence from the Bethlehem case study shows a consistent decline in total travel time under high congestion cases. Variations in the waiting time between different scenarios are exhibited, reflecting the trade-offs in the fitness weighting scheme. We recognize that we have some limitations, including the manual resolution of data and the inherent problem of differences between simulations and real world, and we are proposing a road-map towards a pilot deployment that handles these issues. Rather than proposing a new GA variant, we present a deployment-oriented framework-an edge- assisted GA with explicit protocols and a latency envelope, and a reproducible multi-objective tuning procedure validated on a city-scale network under severe congestion.
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.000 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.001 | 0.000 |
| 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".