Time Coefficient Estimation for Hourly Origin-Destination Demand from Observed Link Flow Based on Semidynamic Traffic Assignment
Bibliographic record
Abstract
Day-long origin-destination (OD) demand estimation for transportation forecasting is advantageous in terms of accuracy and reliability because it is not affected by hourly variations in the OD distribution. In this paper, we propose a method to estimate the time coefficient of day-long OD demand to estimate hourly OD demand and to predict hourly traffic for urban transportation planning of a large-scale road network that lacks discrete-time rich traffic data. The model proposed estimates the time coefficients from observed link flows given a proven day-long OD demand based on a bilevel formulation of the generalized least square and semidynamic traffic assignment (OD-modification approach). The OD-modification approach is formulated as a static user-equilibrium assignment with elastic demand, based on the residual demand at the end of each period. Our model does not require setting many parameters regarding the OD demand matrices and the discrete-time dynamic traffic assignments. Applying the model to large-scale road network demonstrates that it efficiently improves estimation accuracy because the 24-hour time coefficients of survey data are slightly biased and may be modified properly. In addition, the methods that partially relax the assumption of OD-modification approach and transform the estimated demand into demand based on departure time are examined.
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.003 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| 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.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".