A New Stochastic Model for Bus Rapid Transit Scheduling with Uncertainty
Bibliographic record
Abstract
Nowadays, authorities of large cities in the world implement bus rapid transit (BRT) services to alleviate traffic problems caused by the significant development of urban areas. Therefore, a controller is required to control and dispatche buses in such BRT systems.. However, controllers are facing new challenges due to the inherent uncertainties of passenger parameters such as arrival times, demands, alighting fraction as well as running time of vehicles between stops. Such uncertainties may significantly increase the operational cost and the inefficiencies of BRT services. In this paper, we focus on the controller’s perspective and propose a stochastic mixed-integer nonlinear programming (MINLP) model for BRT scheduling to find the optimal departure time of buses under uncertainty. The objective function of the model consists of passenger waiting and traveling time and aims to minimize total time related to passengers at any stop. From the modeling perspective, we propose a new method to generate scenarios for the proposed stochastic MINLP model. Furthermore, from the computational point of view, we implement an outer approximation algorithm to solve the proposed stochastic MINLP model and demonstrate the merits of the proposed solution method in the numerical results. This paper accurately reflect the complexity of BRT scheduling problem and is the first study, to the best of our knowledge, that presents and solves a mixed-integer nonlinear programming model for BRT scheduling.
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.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 0.001 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.002 | 0.002 |
| Insufficient payload (model declined to judge) | 0.004 | 0.001 |
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".