Improved DTTE Method for Route-Level Travel Time Estimation on Freeways
Bibliographic record
Abstract
Travel time estimation plays an important role in advanced traveler information systems (ATIS) for dynamic traffic management. Static travel time estimation (STTE) and dynamic travel time estimation (DTTE) are two of the major methods widely explored for travel time measurement. To analyze their performance on route-level travel time estimation on freeways where congestion may occur, this study developed a framework consisting of four steps: traffic state prediction, travel time estimation, results evaluation, and performance comparison. A METANET-based macroscopic traffic model was developed and employed to predict traffic states based on loop detector data. Then, a novel DTTE method was developed and is proposed herein that combines the piece-wise linear speed-based (PLSB) method and the trajectory assumption algorithm. The indices of the mean absolute relative error (MARE) and the root mean squared error (RMSE) were employed to analyze estimation accuracy by the traditional STTE method and the proposed DTTE method. The comparison results illustrate that during high-demand periods, the proposed DTTE method outperforms the traditional STTE method by producing results that better match reference travel times, which were obtained from video sensors installed along the urban freeway corridor.
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.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.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
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".