The Study of Mass Rapid Transit Train Scheduling Problem - A Case Study of Taipei MRT TamShui and Hsintien line
碩士 === 國立交通大學 === 運輸工程與管理系 === 88 === This thesis focuses on the Taipei mass rapid transit train scheduling problem, especially the TamShui and Hsintien line. We propose an efficient three-stage algorithm for solving this problem. In the first stage, we adopt the column generation technique to gener...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2000
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/74770226862578657432 |
| Summary: | 碩士 === 國立交通大學 === 運輸工程與管理系 === 88 === This thesis focuses on the Taipei mass rapid transit train scheduling problem, especially the TamShui and Hsintien line. We propose an efficient three-stage algorithm for solving this problem. In the first stage, we adopt the column generation technique to generate all possible promising train schedules. Then, we use branch and bound method to determine which schedules will be selected to yield the initial timetable. In the third stage, we examine the initial timetable and develop two heuristic methods to take care of the conflicts occurred on trains and platform. This algorithm was tested on several realistic examples suggested by the Taipei MRT Company. The test results show the column generation method could generate a not-too-bad initial timetable and the heuristic methods could successfully solve the conflicts occurred and make the final solution feasible. Most importantly, our algorithm could obtain the “pseudo” optimal solution in 20-30 hours in stead of 7 full days under the current operation.
|
|---|