Travel time estimation in urban networks using limited probes data
Bibliographic record
Abstract
Travel time is a simple and robust network performance measure that is well understood by the public. However, travel time data collection can be costly especially if the analysis area is large. This research proposes a solution to the problem of limited network sensor coverage caused by insufficient sample size of probe vehicles or inadequate numbers of fixed sensors. Within a homogeneous road network, nearby links of similar character are exposed to comparable traffic conditions, and therefore, their travel times are likely to be positively correlated. This correlation can be useful in developing travel time relationships between nearby links so that if data becomes available on a subset of these links, travel times of their neighbours can be estimated. A methodology is proposed to estimate link travel times using available data from neighbouring links. To test the proposed methodology, a case study was undertaken using a VISSIM micro-simulation model of downtown Vancouver. The simulation model was calibrated and validated using field traffic volumes and travel time data. Neighbour links travel time estimation accuracy was assessed using different error measurements and the results were satisfactory. Overall, the results of this research demonstrate the feasibility of using neighbour links data as an additional source of information to estimate travel time, especially in case of limited coverage.
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.004 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.002 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 0.000 |
| 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 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".