A pragmatic algorithm for the train-set routing: The case of Korea high-speed railway |
| |
Authors: | Sung-Pil Hong Kyung Min Kim Kyungsik Lee Bum Hwan Park |
| |
Institution: | 1. Department of Industrial Engineering, Seoul National University, Republic of Korea;2. Railway Policy and Logistics Department, Korea Railroad Research Institute, Republic of Korea;3. School of Industrial and Management Engineering, Hankuk University of Foreign Studies, Republic of Korea;4. Department of Management Information System, Korea National Railroad College, 374-18, Worm-Dong, Uiwang-Si, Gyeonggi-Do, 437-763, Republic of Korea |
| |
Abstract: | This paper presents a two-phased train-set routing algorithm to cover a weekly train timetable with minimal working days of a minimal number of train-sets. First, relax maintenance requirements and obtain minimum cost routes by solving the polynomial relaxation. Then, maintenance-feasible routes are generated from the crossovers of the minimum cost routes. This pragmatic approach seems particularly effective for the high-speed railway systems, where the railway topology is relatively simple with few end stations while the trains are frequent. Applied to the current weekly timetable of the Korea high-speed railway, we could find an optimal feasible routing, which is an 8.8% improvement over the current routing generated by a set partitioning approach based on a path generation scheme. |
| |
Keywords: | Rail transport Train-set routing Minimum cost flow Maintenance |
本文献已被 ScienceDirect 等数据库收录! |
|