Bibliographic record
Abstract
A bus may be blocked from entering and exiting a stop by other buses and traffic lights. The objective of this paper is to model each type of delay under these phenomena and the overall delay a bus experiences at a stop. Occupy-based delay, transfer block-based delay and block-based delay are defined and modelled. Bus delay at stop is just the sum of these three types of delay. Bus arrival rate, bus service rate, berth number and traffic lights are taken into consideration when modelling delay. Occupy-based delay is modelled with mean waiting time in Queueing theory. Transfer block-based delay and block-based delay are modelled based on standard deviation of waiting time and the probabilities of their occurrences. Two stops in Vancouver, Canada are selected for parameter estimation and model validation. The unknown parameter is estimated as 0.4230 using Ordinary Least Squares (OLS), which indicates that 42.3% of waiting time variation can be attributed to buses being blocked by the buses in front and red light for the selected stops. Model validation shows the average accuracy rate of the proposed model is 75.07% for the selected stops. Bus delay at stop evidently increases when arrival rate is more than 85 buses per hour for the given service time (50 s), ratio of red time to cycle length (0.65) and berth number (2). We also figure out that bus delay at stop evidently increases when service time is more than 60 s for the given arrival rate (54 buses per hour), ratio of red time to cycle length (0.65) and berth number (2). The proposed model can provide a tool for bus stop design and offer the foundation for service quality evaluation of transit.
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.001 |
| 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.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 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".