.png){kind=icon}
.png){kind=icon}
Return
A novel dynamic programming approach for minimum fleet size in electric bus transit lines
.png){kind=icon}
PRE
AI
L
梁
C
Z
Y
DOI：10.1016/j.ejor.2026.08.018.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
• We model electric bus fleet sizing as a space–time MIP and prove peak concurrent trips tightly lower-bound the fleet size. • A heuristic DP algorithm solves weight-based scheduling sub-problem for near-optimal fleet size with much less computation. • Experiments on real and synthetic data confirm superior fleet size and efficiency across diverse settings and extensions.
Keywords:
Electric bus transit line
Vehicle scheduling problem
Minimum fleet size
Dynamic programming
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
Cited Papers