Abstract
The train timetable is a crucial document for organization of railway traffic. A high-quality train timetable is not only implementable in operational environment, but also efficient in terms of capacity utilization of railway infrastructure. In this paper, we try to solve the train timetabling problem of a double track high-speed railway line with heavy traffic and trains with different operational speeds are operated. In order to obtain a feasible timetable with high efficiency, different kinds of headway time are distinguished in the process of train timetabling. With a time expanded graph describing train movements, an integer linear programming is formulated. A branch and price algorithm is proposed to solve the model. The case study shows that more trains will be scheduled when different kinds of headway time considered.
Author supplied keywords
Cite
CITATION STYLE
Liu, P., & Han, B. (2017). Optimizing the train timetable with consideration of different kinds of headway time. Journal of Algorithms and Computational Technology, 11(2), 148–162. https://doi.org/10.1177/1748301816689685
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.