scholarly journals Cyclic Timetable Scheduling Problem on High-speed Railway Line

2019 ◽  
Vol 48 (1) ◽  
pp. 31-38
Author(s):  
Wen Xu ◽  
Yuyan Tan ◽  
Bishal Sharma ◽  
Ziyulong Wang
Keyword(s):  
High Speed ◽  
Mixed Integer ◽  
High Speed Railway ◽  
Railway Line ◽  
System A ◽  
Mip Model ◽  
Proposed Model ◽  
General Constraints ◽  
Train Operation ◽  
Using Data

Due to several obvious advantages both in transport marketing and train operation planning, the cyclic timetable has already applied in many high-speed railway (HSR) countries. In order to adopt the cyclic timetable in China's HSR system, a Mixed Integer Programmer (MIP) model is proposed in this paper involving many general constraints, such as running time, dwell time, headway, and connection constraints. In addition, the real-world overtaking rule that concerning a train with higher priority will not be overtaken by a slower one is incorporated into the cyclic timetable optimization model. An approach based on fixed departure is proposed to get a cyclic timetable with minimum total journey time within a reasonable time. From numerical investigations using data from Guangzhou-Zhuhai HSR line in China, the proposed model and associated approach are tested and shown to be effective.

scholarly journals An Alternative Approach for High Speed Railway Carrying Capacity Calculation Based on Multiagent Simulation

2016 ◽  
Vol 2016 ◽  
pp. 1-10 ◽  
Author(s):  
Mo Gao ◽  
Leishan Zhou ◽  
Yongjun Chen
Keyword(s):  
Carrying Capacity ◽  
High Speed ◽  
Mixed Integer ◽  
Integer Programming Problem ◽  
Railway Network ◽  
High Speed Railway ◽  
Operating Process ◽  
Proposed Model ◽  
Train Operation ◽  
Capacity Calculation

It is a multiobjective mixed integer programming problem that calculates the carrying capacity of high speed railway based on mathematical programming method. The model is complex and difficult to solve, and it is difficult to comprehensively consider the various influencing factors on the train operation. The multiagent theory is employed to calculate high speed railway carrying capacity. In accordance with real operations of high speed railway, a three-layer agent model is developed to simulate the operating process of high speed railway. In the proposed model, railway network agent, line agent, station agent, and train agent are designed, respectively. To validate the proposed model, a case study is performed for Beijing–Shanghai high speed railway by using NetLogo software. The results are consistent with the actual data, which implies that the proposed multiagent method is feasible to calculate the carrying capacity of high speed railway.

Notch-based speed trajectory optimisation for high-speed railway automatic train operation

2021 ◽  
pp. 095440972110421
Author(s):  
Minling Feng ◽  
Chaoxian Wu ◽  
Shaofeng Lu ◽  
Yihui Wang
Keyword(s):  
High Speed ◽  
Applied Force ◽  
Mixed Integer ◽  
High Speed Railway ◽  
Train Operation ◽  
Train Speed ◽  
Automatic Train Operation ◽  
The Impact ◽  
Trajectory Optimisation

Automatic train operation (ATO) systems are fast becoming one of the key components of the intelligent high-speed railway (HSR). Designing an effective optimal speed trajectory for ATO is critical to guide the high-speed train (HST) to operate with high service quality in a more energy-efficient way. In many advanced HSR systems, the traction/braking systems would provide multiple notches to satisfy the traction/braking demands. This paper modelled the applied force as a controlled variable based on the selection of notch to realise a notch-based train speed trajectory optimisation model to be solved by mixed integer linear programming (MILP). A notch selection model with flexible vertical relaxation was proposed to allow the traction/braking efforts to change dynamically along with the selected notch by introducing a series of binary variables. Two case studies were proposed in this paper where Case study 1 was conducted to investigate the impact of the dynamic notch selection on train operations, and the optimal result indicates that the applied force can be flexibly adjusted corresponding to different notches following a similar operation sequence determined by optimal train control theory. Moreover, in addition to the maximum traction/braking notches and coasting, medium notches with appropriate vertical relaxation would be applied in accordance with the specific traction/braking demands to make the model feasible. In Case study 2, a comprehensive numerical example with the parameters of CRH380AL HST demonstrates the robustness of the model to deal with the varying speed limit and gradient in a real-world scenario. The notch-based model is able to obtain a more realistic optimal strategy containing dynamic notch selection and speed trajectory with an increase (1.622%) in energy consumption by comparing the results of the proposed model and the non-notch model.

Macroscopic Real-Time Timetable Rescheduling Approach for High-Speed Railway under Complete Blockages Using a Three-Stage Algorithm

2021 ◽  
pp. 036119812110529
Author(s):  
Bowen Gao ◽  
Decun Dong ◽  
Yusen Wu ◽  
Dongxiu Ou
Keyword(s):  
High Speed ◽  
Mixed Integer ◽  
Activity Time ◽  
Total Delay ◽  
High Speed Railway ◽  
Railway Line ◽  
Optimization Task ◽  
Speed Up ◽  
Milp Model ◽  
The One

The rescheduling of train timetables under a complete blockage is a challenging process, which is more difficult when timetables contain lots of trains. In this paper, a mixed integer linear programming (MILP) model is formulated to solve the problem, following the rescheduling strategy that blocked trains wait inside the stations during the disruption. When the exact end time of the disruption is known, trains at stations downstream of the blocked station can depart early. The model aims at minimizing the total delay time and the total number of delayed trains under the constraints of station capacities, activity time, overtaking rules, and rescheduling strategies. Because there are too many variables and constraints of the MILP model to be solved, a three-stage algorithm is designed to speed up the solution. Experiments are carried out on the Beijing–Guangzhou high-speed railway line from Chibibei to Guangzhounan. The original timetable contains 162 trains, including 29 cross-line trains and 133 local trains. The simulation results show that our model can handle the optimization task of the timetable rescheduling problem very well. Compared with the one-stage algorithm, the three-stage algorithm is proved to greatly improve the solving speed of the model. All instances can get a better optimized disposition timetable within 450 to 600 s, which is acceptable for practical use.

scholarly journals An Affinity Propagation-Based Clustering Method for the Temporal Dynamics Management of High-Speed Railway Passenger Demand

2021 ◽  
Vol 2021 ◽  
pp. 1-11
Author(s):  
Wenxian Wang ◽  
Tie Shi ◽  
Yongxiang Zhang ◽  
Qian Zhu
Keyword(s):  
High Speed ◽  
Temporal Dynamics ◽  
Operation Time ◽  
Affinity Propagation ◽  
High Speed Railway ◽  
Railway Line ◽  
Passenger Flow ◽  
Passenger Demand ◽  
Train Operation ◽  
Railway Passenger

The number of passengers in a high-speed railway line normally varies significantly by the time periods, such as the peak and nonpeak hours. A reasonable classification of railway operation time intervals is essential for an adaptive adjustment of the train schedule. However, the passenger flow intervals are usually classified manually based on experience, which is subjective and inaccurate. Based on the time samples of actual passenger demand data for 365 days, this paper proposes an affinity propagation (AP) algorithm to automatically classify the passenger flow intervals. Specifically, the AP algorithm first merges time samples into different categories together with the passenger transmit volume of the stations, which are used as descriptive variables. Furthermore, clustering validity indexes, such as Calinski–Harabasz, Hartigan, and In-Group Proportion, are employed to examine the clustering results, and reasonable passenger flow intervals are finally obtained. A case study of the Zhengzhou-Xi’an high-speed railway indicates that our proposed AP algorithm has the best performance. Moreover, based on the passenger flow interval classification results obtained using the AP algorithm, the train operation plan fits the passenger demand better. As a result, the indexes of passenger demand satisfaction rate, average train occupancy rate, and passenger flow rate are improved by 7.6%, 16.7%, and 14.1%, respectively, in 2014. In 2015, the above three indicators are improved by 5.7%, 18.4%, and 14.4%, respectively.

scholarly journals A High-speed Train Timetable Rescheduling Approach in case of Disturbances

2020 ◽  
Vol 308 ◽  
pp. 02001
Author(s):  
Xinyu Gao
Keyword(s):  
High Speed ◽  
Programming Model ◽  
Optimal Solution ◽  
Computation Time ◽  
Mixed Integer ◽  
Railway Line ◽  
Train Timetable ◽  
Train Operation ◽  
Time Required ◽  
Short Time

This paper from a macroscopic viewpoint develops a train timetable rescheduling approach on a single high-speed railway line under disturbances, i.e. inevitable train delays in the duration of the train operation. A mixed-integer linear programming model is formulated to minimize the arrival delay and the departure delay altogether. The commercial optimization software CPLEX is adopted in an effort to seek the optimal solution in an acceptably short time required in the real-time rescheduling process. The proposed approach is further tested on a real-world case study and the numerical results show that compared with the results obtain by the traditional genetic algorithm, using CPLEX to solve the model can yield better solutions and consume the desired computation time, thereby demonstrating its effectiveness and efficiency.

scholarly journals Inserting Extra Train Services on High-Speed Railway

2020 ◽  
Vol 49 (1) ◽  
pp. 16-24 ◽  
Author(s):  
Yuyan Tan ◽  
Wen Xu ◽  
Zhibin Jiang ◽  
Ziyulong Wang ◽  
Bo Sun
Keyword(s):  
General Model ◽  
High Speed ◽  
Time Windows ◽  
Integer Program ◽  
Mixed Integer ◽  
Mixed Integer Program ◽  
High Speed Railway ◽  
Train Services ◽  
Acceleration And Deceleration ◽  
Using Data

With the aim of supporting future traffic needs, an account of how to reconstruct an existing cyclic timetable by inserting additional train services will be given in this paper. The Timetable-based Extra Train Services Inserting (TETSI) problem is regarded as an integration of railway scheduling and rescheduling problem. The TETSI problem therefore is considered involving many constraints, such as flexible running times, dwell times, headway and time windows. Characterized based on an event-activity graph, a general Mixed Integer Program model for this problem is formulated. In addition, several extensions to the general model are further proposed. The real-world constraints that concerning the acceleration and deceleration times, priority for overtaking, allowed adjustments, periodic structure and frequency of services are incorporated into the general model. From numerical investigations using data from Shanghai-Hangzhou High-Speed Railway in China, the proposed framework and associated techniques are tested and shown to be effective.

Integrated Overnight Train Scheduling and Maintenance Planning for High-Speed Railway Lines

2020 ◽  
pp. 036119812096883
Author(s):  
Dian Wang ◽  
Shuguang Zhan ◽  
Qiyuan Peng ◽  
Wentao Zhou
Keyword(s):  
High Speed ◽  
Programming Model ◽  
Mixed Integer ◽  
Maintenance Planning ◽  
High Speed Train ◽  
High Speed Railway ◽  
Train Scheduling ◽  
Railway Line ◽  
High Speed Trains ◽  
Commercial Solver

Overnight high-speed trains are very popular and convenient for passengers in countries with a large territory like China. However, the overnight high-speed train operation inevitably conflicts with the regular evening maintenance. We focus on both overnight high-speed train scheduling and maintenance planning to eliminate the conflict. Because some of the daytime high-speed trains that run early in the morning or late in the evening also interact with overnight high-speed trains and maintenance, we also allow them to be to slightly rescheduled to improve both the quality of the overnight train timetable and the maintenance plan. Our integrated optimization problem is formulated as a mixed integer linear programming model, which can be solved efficiently by the commercial solver CPLEX. Finally, we validate our model on a large real-world case constructed based on the Beijing–Guangzhou high-speed railway line in China.

scholarly journals Analysis of ATO System Operation Scenarios Based on UPPAAL and the Operational Design Domain

Electronics ◽  
2021 ◽  
Vol 10 (4) ◽  
pp. 503
Author(s):  
Zicong Meng ◽  
Tao Tang ◽  
Guodong Wei ◽  
Lei Yuan
Keyword(s):  
High Speed ◽  
Test Case ◽  
Design Domain ◽  
System Operation ◽  
High Speed Railway ◽  
Functional Specification ◽  
Operational Design ◽  
Train Operation ◽  
System Requirements ◽  
Automatic Train Operation

With the gradual maturity of the automatic train operation (ATO) system in subways, its application scope has also expanded to the high-speed railway field. Considering that the ATO system is still in the early stages of operation, it will take time to fully mature, and definite specifications of the requirements for system operation have not yet been formed. This paper presents the operational design domain (ODD) of the high-speed railway ATO system and proposes a scenario analysis method based on the operational design domain to obtain the input conditions of the system requirements. The article models and verifies the scenario of the linkage control of the door and platform door based on the UPPAAL tools and extracts the input and expected output of the system requirements of the vehicle ATO system. Combined with the input conditions of the system requirements, the system requirements of the vehicle ATO in this scenario are finally obtained, which provides a reference for future functional specification generation and test case generation.

Typical Portal Structure for Single Track High Speed Railway Tunnel in Rugged Mountainous Area with High and Abrupt Slope

2014 ◽  
Vol 716-717 ◽  
pp. 342-346
Author(s):  
Xiao Jun Zhou ◽  
Bo Jiang ◽  
Yue Feng Zhou ◽  
Yu Yu
Keyword(s):  
High Speed ◽  
Southwest China ◽  
Earth Pressure ◽  
Mountainous Area ◽  
Single Track ◽  
Railway Tunnel ◽  
High Speed Railway ◽  
Railway Line ◽  
Bridge Abutment

On the basis of different landform and multifarious topography in rugged mountainous area in southwest China, typical tunnel portals for single track tunnels in a new high speed railway line have been presented in the paper. The portal comprises headwall, shed tunnel, bridge abutment and its support. Portal with headwall is suitable for tunnel to resist front earth pressure on high and abrupt slope. Shed tunnel is placed in front of headwall so as to prevent rockfall; its outward part is built into a flared one. Meanwhile, the installation of bridge and its abutment are also included in the portal according to landform in the paper.

Sign in / Sign up

Export Citation Format

Share Document