Simulation Study Based on OpenTrack on Carrying Capacity in District of Beijing-Shanghai High-Speed Railway

2014 ◽  
Vol 505-506 ◽  
pp. 567-570 ◽  
Author(s):  
Zhen Chen ◽  
Bao Ming Han

The paper simulated the carrying capacity in Nanjing-Shanghai district of Beijing-Shanghai high-speed railway by using OpenTrack software. Firstly, the paper modeled station topological structure and section topological structure of Beijing-Shanghai high-speed railway and set the parameters for simulation. Secondly, the paper simulated on the condition of current train service frequency no less than the frequency in simulation while the headway was respectively 3 minutes, 4 minutes and 5 minutes. Finally, the paper analyzed the carrying capacity in Nanjing-Shanghai district by analyzing the simulation train diagram outputted by OpenTrack.

2019 ◽  
Vol 11 (24) ◽  
pp. 6996
Author(s):  
Shuo Zhao ◽  
Xiwei Mi ◽  
Zhenyi Li

Train stop planning provides appropriate service for travel demand and stations and plays a significant role in railway operation. This paper formulates stop planning from the point of view of direct travel between origin-destination (O-D) stations and proposes an analytical method to theoretically derive optimal service frequencies for O-D demand on different levels. Considering different O-D demand characteristics and train service types, we introduce the concept of stop probability to present the mathematical formulation for stop planning with the objective of minimizing per capita travel time, which is solved by an iterative algorithm combined with local search. The resulting optimal stop probabilities can be used to calculate the required service frequency for each train type serving different demand categories. Numerical examples, based on three real-life high-speed railway lines, demonstrate the validity of the proposed method. The proposed approach provides a more flexible and practical way for stop planning that explicitly takes into account the importance of different stations and passenger travel characteristics.


2016 ◽  
Vol 2016 ◽  
pp. 1-11 ◽  
Author(s):  
Bin Guo ◽  
Leishan Zhou ◽  
Yixiang Yue ◽  
Jinjin Tang

Methods for solving the carrying capacity problem for High-Speed Railways (HSRs) have received increasing attention in the literature in the last few years. As important nodes in the High-Speed Railway (HSR) network, large stations are usually the carrying capacity bottlenecks of the entire network due to the presence of multiple connections in different directions and the complexity of train operations at these stations. This paper focuses on solving the station carrying capacity problem and considers train set utilization constraints, which are important influencing factors that have rarely been studied by previous researchers. An integer linear programming model is built, and the CPLEX v12.2 software is used to solve the model. The proposed approach is tested on a real-world case study of the Beijing South Railway Station (BS), which is one of the busiest and most complex stations in China. Studies of the impacts of different train set utilization constraints on the practical station carrying capacity are carried out, and some suggestions are then presented for enhancing the practical carrying capacity. Contrast tests indicate that both the efficiency of the solving process and the quality of the solution show huge breakthroughs compared with the heuristic approach.


2015 ◽  
Vol 744-746 ◽  
pp. 1786-1791
Author(s):  
Qian Rui Zhao ◽  
Qi Zhang ◽  
Pei Liu

Carrying capacity calculation at high-speed railway stations is closely related to the trains with different types and arriving rules. Traditional method is not feasible to calculate and evaluate carrying capacity at high-speed railway stations efficiently and accurately. Therefore, a method to calculate carrying capacity at high-speed railway stations was presented by establishing a route selection optimization model and designing corresponding algorithm. In the method, the integration concept of calculating carrying capacity was introduced by establishing the relationship between receiving dispatching route and arrival-departure track. An approach was provided to the solution of route selection scheme and calculating carrying capacity at high-speed railway stations efficiently and accurately by considering the differences of trains with different operation modes and operation time. Case study of Jinan West railway station verifies the feasibility of the method. The presented method can provide a technical support for calculating and evaluating carrying capacity at high-speed railway stations in different scenarios.


2016 ◽  
Vol 2016 ◽  
pp. 1-10 ◽  
Author(s):  
Mo Gao ◽  
Leishan Zhou ◽  
Yongjun Chen

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.


2020 ◽  
Vol 146 (10) ◽  
pp. 04020109
Author(s):  
Qing Wang ◽  
Lianbo Deng ◽  
Yuxin Chen ◽  
Wenliang Zhou ◽  
Feng Niu

2021 ◽  
Vol 40 (1) ◽  
pp. 1509-1519
Author(s):  
Zekun Song ◽  
Haodong Li ◽  
Jintang Shi

Service accessibility can be used to describe the travel time of passengers between different nodes, and opportunities to get transportation services in the high-speed railway (HSR) system. Based on the traditional train line planning theory, this paper introduces the transportation service accessibility index, and propose a new nonlinear passenger train line planning model, which aims to maximize the service accessibility, as well as minimize the operational cost of railway company. The model is transformed into a single-objective model, and then we design a harmony search algorithm to solve it. Finally, the model is validated by a numerical example. The results of this model as well as the scenarios of the single-objective models for minimizing operational costs and maximizing service accessibility are compared. From the perspective of service frequency and accessibility of each nodes, we know that the proposed method can balance conflicts between average speed between large nodes and service frequency of small and medium size nodes in high-speed railway network.


Sign in / Sign up

Export Citation Format

Share Document