Dynamic Search of Train Shortest Routes Within Microscopic Traffic Simulators

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216275%3A25530%2F22%3A39919635" target="_blank" >RIV/00216275:25530/22:39919635 - isvavai.cz</a>

Výsledek na webu

<a href="https://ieeexplore.ieee.org/document/9852419" target="_blank" >https://ieeexplore.ieee.org/document/9852419</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1109/ACCESS.2022.3197660" target="_blank" >10.1109/ACCESS.2022.3197660</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Dynamic Search of Train Shortest Routes Within Microscopic Traffic Simulators

Popis výsledku v původním jazyce

Computer simulations are frequently used for rail traffic optimization. This approach, referred to as simulation-based optimization, typically employs simulation tools - simulators 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 (optimal) train and shunting routes (within the currently occupied infrastructure) along which the rail vehicles are moved. This paper describes novel dynamic route searching algorithms applicable to the relocation of rail vehicles within track infrastructure of railway systems. The following main topics are presented in turn: overview of solutions to the problem of finding track routes in the literature, a suitable rail infrastructure model (associated with algorithms that seek admissible routes for the transfer of the relocation objects of given lengths), graph search algorithms computing the shortest track routes (represented by the admissible shortest walks on graphs), illustrative examples of algorithms&apos; deployment, computational complexity of presented algorithms, comparison with other algorithms and summary of the benefits of newly developed algorithms. 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.

Název v anglickém jazyce

Dynamic Search of Train Shortest Routes Within Microscopic Traffic Simulators

Popis výsledku anglicky

Computer simulations are frequently used for rail traffic optimization. This approach, referred to as simulation-based optimization, typically employs simulation tools - simulators 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 (optimal) train and shunting routes (within the currently occupied infrastructure) along which the rail vehicles are moved. This paper describes novel dynamic route searching algorithms applicable to the relocation of rail vehicles within track infrastructure of railway systems. The following main topics are presented in turn: overview of solutions to the problem of finding track routes in the literature, a suitable rail infrastructure model (associated with algorithms that seek admissible routes for the transfer of the relocation objects of given lengths), graph search algorithms computing the shortest track routes (represented by the admissible shortest walks on graphs), illustrative examples of algorithms&apos; deployment, computational complexity of presented algorithms, comparison with other algorithms and summary of the benefits of newly developed algorithms. 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.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

<a href="/cs/project/EF17_049%2F0008394" target="_blank" >EF17_049/0008394: Spolupráce Univerzity Pardubice a aplikační sféry v aplikačně orientovaném výzkumu lokačních, detekčních a simulačních systémů pro dopravní a přepravní procesy (PosiTrans)</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2022

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

IEEE ACCESS

ISSN

2169-3536

e-ISSN

2169-3536

Svazek periodika

10

Číslo periodika v rámci svazku

Neuveden

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

37

Strana od-do

90163-90199

Kód UT WoS článku

000849237600001

EID výsledku v databázi Scopus

—