Enhancing Electric Shuttle Bus Efficiency: A Case Study on Timetabling and Scheduling Optimization
Bibliographic record
Abstract
As transit authorities increasingly adopt electric buses (EBs) to mitigate air quality concerns and greenhouse gas emissions, new challenges arise in bus scheduling and timetabling. Unlike traditional buses, EBs face operational obstacles due to their shorter range and extended charging times. Existing mathematical optimization models for operation planning of traditional buses must be revised to address these unique characteristics of EBs. This study introduces a new approach to integrate timetabling and bus scheduling to enhance the level of service and minimize operational costs, using a case study of a University shuttle bus service in Montreal, Canada. The level of service will be enhanced by reducing students waiting time and improving their in-vehicle comfort through seat availability. The scheduling aspect seeks to reduce the total operational costs, which include travel, electricity consumption, and usage costs of EBs. The proposed algorithm calculates the waiting time and seat availability for different headway values and addresses the scheduling problem using a mixed-integer linear programming (MILP) model with an arc-based approach, solved using the Cplex Optimization Studio software version 12.8. A normalized weighted sum technique is then applied to select the optimal headway, balancing waiting time, seat availability, and operational costs. The effectiveness of our approach was tested through a case study of Concordia University’s shuttle bus service. Comparative analysis of the current and proposed schedules shows that our approach significantly improves service quality by decreasing waiting times and increasing seat availability while optimizing cost-effectiveness compared to the existing timetable of the Concordia shuttle bus. The proposed approach ensures a smooth transition to a fully electric transit system for shuttle bus services.
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.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| 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".