Abstract

In high-speed rail networks, trains are operated with high speeds and high frequencies, which can satisfy passenger demand with different expected departure times. Given time-dependent demand, this paper proposes a line planning approach with capacity constraints for high-speed rail networks. In this paper, a bilevel optimization model is formulated and the constraints include track section capacity per unit time, train seat capacity, and the gap between the number of starting trains and that of ending trains at a station. In the upper level, the objective is to minimize train operational cost and passenger travel cost, and the decision variables include the line of each train, carriage composition of each train, train stop patterns, train start times, and train arrival and departure times at stops in the line plan. In the lower level, a schedule-based passenger assignment method, which assigns time-varying demand on trains with seat capacity constraints by simulating the ticket-booking process, is used to evaluate the line plan obtained in the upper level. A simulated annealing algorithm is developed to solve the model in which some strategies are designed to search for neighborhood solutions, including reducing train carriages, deleting trains, adding trains, increasing train carriages, and adjusting train start times. Finally, an application to the Chinese high-speed rail network is presented. The numerical results show that (i) the average time deviations between the expected departure times and the actual boarding times of passengers are within 30 min, (ii) the unserved passengers are less than 200, and (iii) the average load factors of trains are about 70%. Hence, line plan solutions meet time-dependent demand well and satisfy the capacity constraints for high-speed rail networks.

Highlights

  • In the past few years, high-speed rail (HSR) has a rapid development in the world, especially China

  • Given time-dependent demand, this paper proposes a line planning approach with capacity constraints for high-speed rail networks

  • According to the “Mid-Long Term Railway Network Plan” issued by the National Development and Reform Commission [1] in China on July 13, 2016, the length of the operational HSR will be up to 30,000 km in 2020 and “eight vertical and eight horizontal” HSR network will be built in China

Read more

Summary

Introduction

In the past few years, high-speed rail (HSR) has a rapid development in the world, especially China. Kaspi and Raviv [10], based on time-dependent demand, proposed an integrated line planning and timetabling approach for passenger trains with the objective of minimizing both user inconvenience and operational costs, solved using a crossentropy metaheuristic. Their experiment was based on a middle-size rail network (consisting of 1,000 km rail tracks and 77 stations) and the integrated approach was conducted in a single cycle (one hour). This paper proposes a line planning approach with time-dependent demand and capacity constraints for HSR networks to optimize synthetically the lines of trains, carriage compositions of trains, train stop patterns, train start times, and train arrival and departure times at stops. The last section concludes the paper and discusses future research topics

Problem Statement and Notations
Model Formulation
Algorithm
Application to the Chinese HSR Network
Findings
Conclusions and Future Studies
Full Text
Paper version not known

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

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.