Train routing in shunting yards using Answer Set Programming

Adlbrecht, Jan-Alexander; Hüttler, Benno; Ilo, Nikola; Gronalt, Manfred

doi:10.1016/j.eswa.2015.05.044

Cited by 14 publications

(8 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…When solving the problem of searching for train routes on a track infrastructure, the route optimization can be based on a minimization of the route length. This problem constitutes a part of a wider problem called the train routing problem, which includes, among other things, the following tasks: route assignment to the trains within extensive railway network areas [5]; coordinated assignment of track routes to multiple trains in the railway stations [6,7,8,9]; identification of the single train shortest route [1,10,11,12]; etc. The layout of the track infrastructure on which the traffic takes place must be taken into account when addressing problems of this type.…”

Section: Related Literaturementioning

confidence: 99%

Dynamic Search of Train Shortest Routes Within Microscopic Traffic Simulators

Kavička

Diviš

2022

IEEE Access

View full text Add to dashboard Cite

Computer simulations are frequently used for rail traffic optimization. This approach, referred to as simulation-based optimization, typically employs simulation toolssimulators that are designed to examine railway systems at various levels of detail. Microscopic rail traffic simulators find use when examining rail traffic and the rail infrastructure in great detail. Such simulators typically serve to follow the positions and motions of rail vehicles (trains, locomotives, train cars) and their relocation as well as segments of the rail infrastructure (tracks, switches, track crossings). One of the typical problems to be solved by microscopic simulators within a simulation experiment is to determine the realistic train and shunting routes (within the currently occupied infrastructure) along which the rail vehicles are moved. This requires a suitable rail infrastructure model, associated with algorithms that seek admissible routes for the transfer of the relocation objects. This paper describes novel dynamic route searching algorithms applicable to the relocation of rail vehicles within track infrastructure of railway systems. The infrastructure model is represented by a specific edge-weighted undirected graph. The routes computed by the algorithms coincide with specific shortest walks in the graph, taking into account the particular relocation object lengths. The use of the algorithms within the simulation tools (working at the microscopic level of detail) extends the modelling possibilities when searching for realistic track routes (especially for complicated shunting operations), which contributes to better modelling of complex railway traffic (than in the relevant existing rail traffic simulators) and thus to better application of the results of traffic simulations in practice.INDEX TERMS rail traffic, simulation-based optimizations, single-train shortest routes

show abstract

Section: Related Literaturementioning

confidence: 99%

Dynamic Search of Train Shortest Routes Within Microscopic Traffic Simulators

Kavička

Diviš

2022

IEEE Access

View full text Add to dashboard Cite

show abstract

“…One of the important optimization tasks consists in solving the train routing problem. is extensive problem includes, for instance, the following partial tasks: rail line assignment to trains within the extensive areas of railway networks [1,2]; coordinated assignment of track routes to more than one train in the railway station [3][4][5][6]; and identification of suitable track routes for rail vehicle shunting [7]. Among the relevant factors playing a role when solving such problems is the configuration of the specific infrastructure on which the traffic takes place.…”

Section: Literature Reviewmentioning

confidence: 99%

Dynamic Automated Search of Shunting Routes within Mesoscopic Rail-Traffic Simulators

Kavička

Krýže

2021

Journal of Advanced Transportation

View full text Add to dashboard Cite

Software tools using computer simulations are frequently used in the research and optimization of railway transport systems. Such simulations serve to examine different railway traffic scenarios (which typically reflect different timetables and railway infrastructure configurations). During the simulation experiments, it is necessary, among other things, to solve tasks related to the determination of track routes along which individual trains or parts of train sets are moved. Many simulation tools require the basic and alternative permissible track routes to be manually specified before starting the simulations, which is a relatively tedious and time-consuming process. Classical graph algorithms cannot be applied to solve the problem of automatic calculation of the routes because they are unable to take into account the length of the object being moved or recognise changes in the direction of its movement. This article presents original innovative algorithms focused on automated dynamic search of track routes (applying an appropriate optimization criterion), which is performed during simulation experiments within simulators working at the mesoscopic level of detail. The algorithms are based on a mathematical model (represented by a specifically designed weighted digraph) that appropriately reflects the actual track infrastructure. The dynamic calculation of each specific track route for a train or a group of railway vehicles considers both the total train set length and the current railway infrastructure occupancy, including blocked parts of the infrastructure due to intervention of the interlocking system. In addition, the places where the train set movement direction is changed can be identified on each route found. Applications of the algorithms and of the mathematical model of the track layout are demonstrated on a model track infrastructure.

show abstract

“…Some of these are studies carried out at the network level and some are carried out on activities in the railway station. In the first category algorithms and solutions are presented for the best path of the freight wagon through the railway network according to the number of shunting stages [1,3,4,9,10].…”

Section: Literature Reviewmentioning

confidence: 99%

Assessing the Transit Capacity of Port Shunting Yards Through Discrete Simulation

Rusca¹,

Popa²,

Roșca³

et al. 2019

Transport Problems

View full text Add to dashboard Cite

The port shunting yards are developed inside the area of the ports. The main activities are to receive the freight trains from the hinterland, to shunt the freight wagons according to their final destinations from the area of the port, to receive the wagons from maritime terminals, to accumulate wagons according to their destination, and to depart the freight train to the hinterland. So, it is important for port administration to have good methods to evaluate the transit capacity of port shunting yards. A feasible method is to use the discrete simulation model. In our paper, we develop one of this taking into consideration the input flow characteristics of freight trains from land network, the input flow characteristics of freight wagons from maritime terminals, the number of tracks in a port railway station, the technology used for separation of freight wagons on destinations (inside the port or from hinterland), and the duration of technological processes. From the results, we extract the values of trains and wagon sets that transit through the main areas of the railway station (Receiving Tracks, Hump(s) and Departure Tracks).

show abstract

Train routing in shunting yards using Answer Set Programming

Cited by 14 publications

References 8 publications

Dynamic Search of Train Shortest Routes Within Microscopic Traffic Simulators

Dynamic Search of Train Shortest Routes Within Microscopic Traffic Simulators

Dynamic Automated Search of Shunting Routes within Mesoscopic Rail-Traffic Simulators

Assessing the Transit Capacity of Port Shunting Yards Through Discrete Simulation

Contact Info

Product

Resources

About