Optimizing Customized Transit Service considering Stochastic Bus Arrival Time
Bibliographic record
Abstract
The introduction of customized bus (CB) service intends to expand and elevate existing transit service, which offers an efficient and sustainable alternative to serve commuters. A probabilistic model is proposed to optimize CB service with mixed vehicle sizes in an urban setting considering stochastic bus arrival time and spatiotemporal demand, which minimizes total cost subject to bus capacity and time window constraints. The studied optimization problem is combinatorial with many decision variables including vehicle assignment, bus routes, timetables, and fleet size. A heuristic algorithm is developed, which integrates a hybrid genetic algorithm (HGA) and adaptive destroy-and-repair (ADAR) method. The efficiency of HGA-ADAR is demonstrated through numerical comparisons to the solutions obtained by LINGO and HGA. Numerical instances are carried out, and the results suggested that the probabilistic model considering stochastic bus arrival time is valuable and can dramatically reduce the total cost and early and late arrival penalties. A case study is conducted in which the proposed model is applied to optimize a real-world CB service in Xi’an, China. The relationship between decision variables and model parameters is explored. The impacts of time window and variance of bus arrival time, which significantly affect service reliability, are analysed.
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.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| 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.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".