| Summary: | 碩士 === 國立交通大學 === 運輸與物流管理學系 === 101 === Due to the rapid development of electric buses, electric bus scheduling becomes an important issue for many bus carries. We first formulate this problem as a set-partitioning problem. The column generation based algorithms are proposed for solving this model. The algorithm consists of three phases: column generation, branch and bound, and heuristic local search. The column generation sub-problem is formulated as a multi-attribute shortest path problem with extra side constraints. We also propose a multi-label shortest path algorithm based on the Dijkstra’s algorithm for generating new column.
This study uses simulated testing problems to evaluate the performance of the algorithm. The simulated problems consist of four characteristics: service frequency, path length, number of electric charging stations and type of charging station. The testing results show the proposed model and the associated solving technique are sound and promising. The numerical experiments also show that the increment of charging stations could effectively decrease the number of buses required.
|
|---|
