Modeling schedule recovery processes in transit operations for bus arrival time prediction
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Abstract Many existing algorithms for bus arrival time prediction assume that buses travel at free‐flow speed in the absence of congestion. As a result, delay incurred at one stop would propagate to downstream stops at the same magnitude. In reality, skilled bus operators often constantly adjust their speeds to keep their bus on schedule. This paper formulates a Markov chain model for bus arrival time prediction that explicitly captures the behavior of bus operators in actively pursuing schedule recovery. The model exhibits some desirable properties in capturing the schedule recovery process. It guarantees provision of the schedule information if the probability of recovering from the current schedule deviation is sufficiently high. The proposed model can be embedded into a transit arrival time estimation model for transit information systems that use both real‐time and schedule information. It also has the potential to be used as a decision support tool to determine when dynamic or static information should be used.
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.
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.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 0.000 |
| 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 it