Abstract
In order to support the process of scheduling a hybrid cyclic timetable, this paper is devoted to inserting additional non-cyclic train paths into existing cyclic timetable. The adding train paths problem is an integration of timetable scheduling and rescheduling problem. The train dispatcher can not only modify the given timetable to manage the interruptions in existing operations, but also establish schedules for additional trains. A multi-objective model minimizing both the travel time of additional trains and the variation of existing trains is proposed in this paper. In addition, we consider both general constraints and some additional practical constraints, such as the overtaking priority constraint, reasonable adjustment of initial schedules and the scheduled connections. This problem is very difficult and must be solved in practice. A heuristic algorithm is introduced to find high-quality solutions for large-scale cases within reasonable computing time. Based on high-speed railway line in China, the case studies illustrate the methodology and compare the performance of trains. Numerical experiments indicate that the proposed solution approach to the adding train paths problem is promising.
Highlights
In 1931, Dutch scholar proposed the concept of the cyclic timetable with a cycle time of one hour
SOLUTION APPROACH Considering the large numbers of constraints and variables used in the mathematical formulation, we decide to develop a heuristic algorithm based on genetic algorithm (GA) in order to obtain good quality solutions to the adding train paths (ATP) in real-world applications in reasonable computing times
It shows that 81.7% of the trains have the same departure time at the original station as it in the initial cyclic timetable, and about 73.1% arrival times at destinations of the scheduled trains are shift less than 15 min from those requested by inserting new trains
Summary
In 1931, Dutch scholar proposed the concept of the cyclic timetable with a cycle time of one hour. Comparison of timetable scheduling, rescheduling and adding train paths problem Such as some relatively short lines with high frequency commuting train services. With low frequency train services and long-distance HSR lines, a pure cyclic timetable is not suitable to be applied. If these low frequency trains are scheduled as cyclic ones, it will lead to capacity waste. Models and algorithms of cyclic timetabling have been developed very well, there is still an important research demand for the technique of inserting additional trains into an existing cyclic timetable Based on this background, this paper studies the adding train paths (ATP) problem for dispatching additional trains in an initial cyclic timetable.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
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 callDisclaimer: 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.
