Optimization Of Rolling Stock Circulation

• Main Authors: Kuan-ChiehHuang, 黃冠捷
• Other Authors: Yusin Lee
• Format: Others
• Language: zh-TW
• Published: 2013
• Online Access: http://ndltd.ncl.edu.tw/handle/41609403717883070603

碩士 === 國立成功大學 === 土木工程學系碩博士班 === 101 === The railway system relies heavily on planning. Usage of all of the major resources, crew, rolling stock, and railway capacity requires careful planning to achieve high operation efficiency. In this study we focus on the optimization of rolling stock circulation. Taking the Taiwan Railways Administration (TRA) system as the topic, we first define the problem and identify some of the most important factors that should be taken into consideration. The TRA is a complex system offering approximately 1000 daily services. Its rolling stock has to depart from a depot, execute a number of services, and return to the same depot. A feasible plan has to comply with a number of regulations, including maximum mileage between regular maintenance, minimum connection time between services, depot capacity, and others. While the timetable is given, in practice it is still possible to slightly alter the arrival and departure times to achieve better rolling stock efficiency. The optimization goal is to minimize the number of train set used, as well as to minimize deadheading mileage. As a first attempt to study the rolling stock circulation problem for TRA, in this work we simplify the requirements and propose a three-stage method to solve the problem. The first stage uses a time-space network to obtain a number of candidate train routes. The second stage employes a linear program to adjust the given timetable, and the final stage uses an integer program to select the best combination among the candidate routes. Numerical testing indicated that the obtained plan is comparible with the real plans.