Bus Predictive-Control Method considering the Impact of Traffic Lights
Bibliographic record
Abstract
Amid the COVID-19 pandemic, many travelers have switched from public transit to other modes. How to maintain the stability and service quality of the bus system under regular pandemic prevention and control, so as to maintain the attractiveness of the bus, is an important research direction. Predicting operation states and adopting appropriate control measures for running buses are effective means of improving the bus system’s schedule reliability and service quality. Focusing on the impacts of intersection traffic lights on the link’s travel time durations, we establish a probabilistic prediction model for bus headways, classifying the bus headways into three states: bunching, stable, and big gap states. Based on the prediction of bus headways, the most suitable control strategy is selected by the proposed method from the plan set, such as holding control, speed-adjusting control, and stop-skipping control to minimize the bus headway deviation. Simulation experiments were employed to verify the effectiveness of the proposed method. Compared with the no-control situation, the expected headway variation, average passenger waiting time, and bus bunching frequency for 100 simulations by the proposed method are reduced by 77.73%, 41.66%, and 87.11%, respectively. Compared with some control methods without prediction, the proposed method is more robust, maintains good control performance, and reduces bus bunching despite significant variations in environmental parameters. In addition, the model still performs well when considering the execution errors of bus drivers.
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 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.001 | 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.000 |
| 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, 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".