| Summary: | 碩士 === 國立交通大學 === 運輸工程與管理系 === 89 === As a result, the bus company drivers scheduling operations were not usually efficient. This research thus attempts to develop a model that helps bus company in timetable drafting so that their operations can be improved.
This thesis proposes an algorithm to improve the efficiency for solving the drivers scheduling problem of the mass transport company. We formulate this problem as a set-partitioning problem. A three phases algorithm, Lagrangean relaxation, network simplex, and a adjusted strategy algorithm built by myself , is then developed for solving this model.
First, We use Lagrangean relaxation technique to relax all side constraints then the model become a pure network problem. Second, a adjusted strategy algorithm is applied to solve the solution’s unreasonableness which is caused by relaxing the constraints. Finally, we use network simplex technique to obtain the integer.
In order to evaluate the model and algorithm in practice, a case study concerning the operation of major bus companies in Taiwan is performed. The results show that our algorithm could get better solutions with higher operational feasibility than the current one does.
|
|---|
