scholarly journals Train Stop Scheduling in a High-Speed Rail Network by Utilizing a Two-Stage Approach

2012 ◽  
Vol 2012 ◽  
pp. 1-11 ◽  
Author(s):  
Huiling Fu ◽  
Lei Nie ◽  
Benjamin R. Sperry ◽  
Zhenhuan He
Keyword(s):  
High Speed ◽  
Large Scale ◽  
Programming Model ◽  
Practical Experience ◽  
Mixed Integer ◽  
Two Stage ◽  
High Speed Rail ◽  
Rail Network ◽  
Passenger Traffic ◽  
The One

Among the most commonly used methods of scheduling train stops are practical experience and various “one-step” optimal models. These methods face problems of direct transferability and computational complexity when considering a large-scale high-speed rail (HSR) network such as the one in China. This paper introduces a two-stage approach for train stop scheduling with a goal of efficiently organizing passenger traffic into a rational train stop pattern combination while retaining features of regularity, connectivity, and rapidity (RCR). Based on a three-level station classification definition, a mixed integer programming model and a train operating tactics descriptive model along with the computing algorithm are developed and presented for the two stages. A real-world numerical example is presented using the Chinese HSR network as the setting. The performance of the train stop schedule and the applicability of the proposed approach are evaluated from the perspective of maintaining RCR.

scholarly journals A Mixed Integer Linear Programming Method for Simultaneous Multi-Periodic Train Timetabling and Routing on a High-Speed Rail Network

2020 ◽  
Vol 12 (3) ◽  
pp. 1131
Author(s):  
Wenliang Zhou ◽  
Xiaorong You ◽  
Wenzhuang Fan
Keyword(s):  
Linear Programming ◽  
Integer Linear Programming ◽  
Mixed Integer Linear Programming ◽  
High Speed ◽  
Programming Model ◽  
Mixed Integer ◽  
High Speed Rail ◽  
Train Timetabling ◽  
Train Timetable ◽  
The Impact

To avoid conflicts among trains at stations and provide passengers with a periodic train timetable to improve service level, this paper mainly focuses on the problem of multi-periodic train timetabling and routing by optimizing the routes of trains at stations and their entering time and leaving time on each chosen arrival–departure track at each visited station. Based on the constructed directed graph, including unidirectional and bidirectional tracks at stations and in sections, a mixed integer linear programming model with the goal of minimizing the total travel time of trains is formulated. Then, a strategy is introduced to reduce the number of constraints for improving the solved efficiency of the model. Finally, the performance, stability and practicability of the proposed method, as well as the impact of some main factors on the model are analyzed by numerous instances on both a constructed railway network and Guang-Zhu inter-city railway; they are solved using the commercial solver WebSphere ILOG CPLEX (International Business Machines Corporation, New York, NY, USA). Experimental results show that integrating multi-periodic train timetabling and routing can be conducive to improving the quality of a train timetable. Hence, good economic and social benefits for high-speed rail can be achieved, thus, further contributing to the sustained development of both high-speed railway systems and society.

scholarly journals ENSURING TRAIN SAFETY ON HIGH-SPEED RAIL-HIGHWAY

2021 ◽  
Vol 118 (3) ◽  
pp. 28-33
Author(s):  
Dayana Bitigova ◽  
Dinar Bekzhanov ◽  
Saule Bekzhanova
Keyword(s):  
High Speed ◽  
Western Europe ◽  
Low Cost ◽  
Normal Operation ◽  
High Speed Rail ◽  
Traffic System ◽  
Rail Network ◽  
Passenger Traffic ◽  
High Speed Trains ◽  
Train Safety

Modern high-speed trains in normal operation develop speeds of up to 350-400 km / h, and in tests they can even accelerate to 560-580 km/h. Due to the speed of service and high speed of movement, they seriously compete with other modes of transport, while maintaining such a property of all trains as low cost of transportation with a large volume of passenger traffic. For the first time the regular movement of high-speed trains began in 1964 in Japan under the Shinkansen project. In 1981, VSNT trains began to run in France, and soon most of Western Europe, including even the island of Great Britain, became connected by a single high-speed rail network. At the beginning of the XXI century, China became the world leader in the development of a network of high-speed lines, as well as the operator of the first regular high-speed maglev.In Russia, the regular operation of high-speed trains "Sapsan", on common tracks with conventional trains, began at the end of 2009. Since 2013, the idea of building the first specialized high-speed railway Moscow-Kazan (cargo-passenger) for the national high-speed traffic system has been discussed.Most of the high-speed trains carry passengers, but there are varieties designed for the transport of goods. For example, the French service La Poste has used special TGV electric trains for 30 years, which served to transport mail and parcels (their operation was completed in June 2015 due to the decrease in the volume of mailings in recent years).

A hierarchical line planning approach for a large-scale high speed rail network: The China case

2015 ◽  
Vol 75 ◽  
pp. 61-83 ◽  
Author(s):  
Huiling Fu ◽  
Lei Nie ◽  
Lingyun Meng ◽  
Benjamin R. Sperry ◽  
Zhenhuan He
Keyword(s):  
High Speed ◽  
Large Scale ◽  
High Speed Rail ◽  
Line Planning ◽  
Rail Network ◽  
Planning Approach

A real-time control method-based simulation for high-speed trains on large-scale rail network

2017 ◽  
Vol 28 (10) ◽  
pp. 1750126 ◽  
Author(s):  
Yutong Liu ◽  
Chengxuan Cao ◽  
Yaling Zhou ◽  
Ziyan Feng
Keyword(s):  
Real Time ◽  
Traffic Flow ◽  
High Speed ◽  
Large Scale ◽  
Simulation Method ◽  
Real Time Control ◽  
Rail Network ◽  
Time Control ◽  
High Speed Trains ◽  
Rail Traffic

In this paper, an improved real-time control model based on the discrete-time method is constructed to control and simulate the movement of high-speed trains on large-scale rail network. The constraints of acceleration and deceleration are introduced in this model, and a more reasonable definition of the minimal headway is also presented. Considering the complicated rail traffic environment in practice, we propose a set of sound operational strategies to excellently control traffic flow on rail network under various conditions. Several simulation experiments with different parameter combinations are conducted to verify the effectiveness of the control simulation method. The experimental results are similar to realistic environment and some characteristics of rail traffic flow are also investigated, especially the impact of stochastic disturbances and the minimal headway on the rail traffic flow on large-scale rail network, which can better assist dispatchers in analysis and decision-making. Meanwhile, experimental results also demonstrate that the proposed control simulation method can be in real-time control of traffic flow for high-speed trains not only on the simple rail line, but also on the complicated large-scale network such as China’s high-speed rail network and serve as a tool of simulating the traffic flow on large-scale rail network to study the characteristics of rail traffic flow.

A Novel Approach for Two-Stage UAV Path Planning in Pipeline Network Inspection

2020 ◽  
Author(s):  
Rui Qiu ◽  
Yongtu Liang
Keyword(s):  
Path Planning ◽  
Large Scale ◽  
Flight Path ◽  
Mixed Integer ◽  
Optimization Approach ◽  
Two Stage ◽  
Calculation Time ◽  
Pipeline Network ◽  
Second Stage ◽  
Computational Performance

Abstract Currently, unmanned aerial vehicle (UAV) provides the possibility of comprehensive coverage and multi-dimensional visualization of pipeline monitoring. Encouraged by industry policy, research on UAV path planning in pipeline network inspection has emerged. The difficulties of this issue lie in strict operational requirements, variable flight missions, as well as unified optimization for UAV deployment and real-time path planning. Meanwhile, the intricate structure and large scale of the pipeline network further complicate this issue. At present, there is still room to improve the practicality and applicability of the mathematical model and solution strategy. Aiming at this problem, this paper proposes a novel two-stage optimization approach for UAV path planning in pipeline network inspection. The first stage is conventional pre-flight planning, where the requirement for optimality is higher than calculation time. Therefore, a mixed integer linear programming (MILP) model is established and solved by the commercial solver to obtain the optimal UAV number, take-off location and detailed flight path. The second stage is re-planning during the flight, taking into account frequent pipeline accidents (e.g. leaks and cracks). In this stage, the flight path must be timely rescheduled to identify specific hazardous locations. Thus, the requirement for calculation time is higher than optimality and the genetic algorithm is used for solution to satisfy the timeliness of decision-making. Finally, the proposed method is applied to the UAV inspection of a branched oil and gas transmission pipeline network with 36 nodes and the results are analyzed in detail in terms of computational performance. In the first stage, compared to manpower inspection, the total cost and time of UAV inspection is decreased by 54% and 56% respectively. In the second stage, it takes less than 1 minute to obtain a suboptimal solution, verifying the applicability and superiority of the method.

scholarly journals Optimal Torpedo Scheduling

2018 ◽  
Vol 63 ◽  
pp. 955-986 ◽  
Author(s):  
Adrian Goldwaser ◽  
Andreas Schutt
Keyword(s):  
Large Scale ◽  
Benders Decomposition ◽  
Steel Production ◽  
Planning Horizon ◽  
Mixed Integer ◽  
Hot Metal ◽  
Rail Network ◽  
Sulfur Level ◽  
First Time ◽  
Resource Capacity

We consider the torpedo scheduling problem in steel production, which is concerned with the transport of hot metal from a blast furnace to an oxygen converter. A schedule must satisfy, amongst other considerations, resource capacity constraints along the path and the locations traversed as well as the sulfur level of the hot metal. The goal is first to minimize the number of torpedo cars used during the planning horizon and second to minimize the time spent desulfurizing the hot metal. We propose an exact solution method based on Logic based Benders Decomposition using Mixed-Integer and Constraint Programming, which optimally solves and proves, for the first time, the optimality of all instances from the ACP Challenge 2016 within 10 minutes. In addition, we adapted our method to handle large-scale instances and instances with a more general rail network. This adaptation optimally solved all challenge instances within one minute and was able to solve instances of up to 100,000 hot metal pickups.

Sign in / Sign up

Export Citation Format

Share Document