Optimizing Minimum Headway Time and Its Corresponding Train Timetable for a Line on a Sparse Railway Network

• Main Authors: Weining Hao, Lingyun Meng, Yuyan Tan
• Format: Article
• Language: English
• Published: MDPI AG 2020-07-01
• Series: Symmetry
• Subjects: optimal minimum headway time; train timetabling; transport demand; genetic algorithm
• Online Access: https://www.mdpi.com/2073-8994/12/8/1223

In western China, railway lines are sparse, and there is a large fluctuation in transport demand under different transportation scenarios, which yields severe difficulties in setting up a signaling system and making a train timetable. To meet the fluctuating transport demand effectively and provide efficient train services in the changing multimodal transportation market, a new Chinese train control system based on flexible minimum headway time (FCTCS) is introduced and going to be implemented. Considering that the cost of implementing signaling systems corresponding to different minimum headway times varies significantly, it is necessary to find an optimal minimum headway time and design its corresponding train timetable. In this paper, we propose a mixed integer linear programming model for selecting an optimal minimum headway time, with which a satisfactory train timetable is generated with the consideration of symmetry transport demand. The objective function is to maximize the total profit of train operation. We further develop genetic algorithm with an integer and binary coding method for searching for the solution. Finally, a set of numerical tests based on a railway line in a sparse railway network in western China is used to demonstrate the validity and effectiveness of the proposed model.