Noniterative Approach to Dynamic Traffic Origin–Destination Estimation with Parallel Evolutionary Algorithms
Bibliographic record
Abstract
This study focuses on updating time-varying demand matrices by using real observation counts from advanced traffic management surveillance systems. A machine-learning technique using advanced evolutionary algorithms (EAs) is developed instead of the more conventional approaches in the literature. This EA-based demand estimation framework is implemented into a model called the Dynamic Origin–Destination (O-D) Estimator (DynODE). The potential of EAs in the dynamic O-D estimation problem lies in their powerful global search and optimization capabilities. DynODE is integrated with an existing dynamic traffic assignment platform (e.g., DYNASMART-P). The EA-based methods in this study are further augmented with EA parallelization to improve the quality and efficiency of the solution. DynODE mainly addresses offline O-D estimation problems. However, online O-D estimation can be achieved with the parallel version of DynODE with sufficient multiprocessing and parallel computing. The developed approach is rigorously evaluated on a medium-sized real network to assess the effects of various parallel structures. For all experiments, savings in computation resources as well as enhancement in the quality of solution were realized.
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.004 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.004 |
| Science and technology studies | 0.002 | 0.001 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| 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".