Abstract
The most important operating problem for intercity rail lines, which are characterized with the train operations at rapid speed and high frequency, is to design a service‐oriented schedule with the minimum cost. This paper proposes a phase‐regular scheduling method which divides a day equally into several time blocks and applies a regular train‐departing interval and the same train length for each period under the period‐dependent demand conditions. A nonlinear mixed zero‐one programming model, which could accurately calculate the passenger waiting time and the in‐train crowded cost, is developed in this study. A hybrid genetic algorithm associated with the layered crossover and mutation operation is carefully designed to solve the proposed model. Finally, the effectiveness of the proposed model and algorithm is illustrated through the application to Hefei‐Wuhan intercity rail line in China.
Highlights
Intercity rail lines, as a rapid transport mode connecting two cities, have been paid much attention by the governments all over the world
The operations are characterized with rapid speed and high frequency, and the process of passengers arriving at the stations are time-dependent and stochastic
This paper focuses on an intercity rail line and proposes a phase-regular scheduling method, which divides a day into several time blocks and applies the regular train-departing interval and the same train length during each period
Summary
As a rapid transport mode connecting two cities, have been paid much attention by the governments all over the world. The operations are characterized with rapid speed and high frequency, and the process of passengers arriving at the stations are time-dependent and stochastic. Ghoseiri et al 5 built a multiobjective optimization model for the passenger train scheduling problem on a rail network which includes single and multiple tracks, as well as multiple platforms with different train capacities. Zhou and Zhong 7 formulated train scheduling models which consider segment and station headway capacities as limited resources, and developed algorithms to minimize both the expected passenger waiting times and total train travel times. Chang et al built a multiobjective programming model for the optimal allocation of passenger train services on an intercity high-speed rail line without branches. The last section brings the paper to a conclusion and outlines the possibilities for future research in related areas
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
