A MultiObjective Optimization Approach for Integrated Timetabling and Vehicle Scheduling with Uncertainty
Bibliographic record
Abstract
The timetabling problem (TTP) and vehicle scheduling problem (VSP) are two indispensable problems in public transit planning process. They used to be solved in sequence; hence, optimality of resulting solutions is compromised. To get better results, some integrated approaches emerge to solve the TTP and VSP as an integrated problem. In the existing integrated approaches, the passenger comfort on bus and the uncertainty in the real world are rarely considered. To provide better service for passengers and enhance the robustness of the schedule to be compiled, we study the integrated optimization of TTP and VSP with uncertainty. In this paper, a novel multiobjective optimization approach with the objectives of minimizing the passenger travel cost, the vehicle scheduling cost, and the incompatible trip-link cost is proposed. Meanwhile, a multiobjective hybrid algorithm, which is a combination of the self-adjust genetic algorithm (SGA), large neighborhood search (LNS) algorithm, and Pareto separation operator (PSO), is applied to solve the integrated optimization problem. The experimental results show that the approach outperforms existing approaches in terms of service level and robustness.
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.002 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 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.002 | 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".