Timetable Scheduling considering Transit Assignment

• Main Authors: Hua-Yen Wu, 巫驊晏
• Other Authors: 朱致遠
• Format: Others
• Language: en_US
• Published: 2017
• Online Access: http://ndltd.ncl.edu.tw/handle/ebc7j5

碩士 === 國立臺灣大學 === 土木工程學研究所 === 105 === Travel time of passengers is one of the most important issues for public transit planning. In this study, a mixed-integer linear programming (MILP) generating an optimal timetable is proposed as an optimization framework for transit scheduling. It is realistic that the passengers choose their route choice based on the timetable, hence passenger change their route when timetables are altered. However, past studies assume that demand is constant. Therefore, the goal of this paper is to minimize total travel time of passengers while considering passenger route choice. This model is composed of the passenger network flow, the connection of timetable and the integration of passengers and buses. To enhance the solution efficiency, the proposed model is reformulated into a set-partitioning problem in purpose of reducing the scale of the problem, and an incremental assignment heuristic is developed. Through the procedure of heuristic, the route choice of passengers is determined separately in several iterations for the purpose of decreasing computational time. A case is demonstrated and the routes of passengers are analyzed. The solution shows that the proposed model is efficient. A computational study is conducted to evaluate the performance of the proposed methodology.