Optimizing the train timetable with consideration of different kinds of headway time. Issue 2 (June 2017)

• Record Type: Journal Article
• Authors: Liu, Pei; Han, Baoming
• Is Part Of: Journal of algorithms & computational technology. Volume 11:Issue 2(2017)
• Page Start: 148
• Page End: 162
• Publication Date: 2017-06
• Subjects: Train timetabling -- headway time -- time expanded graph -- branch and price algorithm -- integer linear programming; Computer algorithms -- Periodicals; Numerical calculations -- Periodicals; Computer algorithms; Numerical calculations; Periodicals; 518.1
• DOI: 10.1177/1748301816689685
• Languages: English
• ISSNs: 1748-3018

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.