All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

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

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216275%3A25530%2F21%3A39918214" target="_blank" >RIV/00216275:25530/21:39918214 - isvavai.cz</a>

  • Result on the web

    <a href="https://www.hindawi.com/journals/jat/2021/8840516/" target="_blank" >https://www.hindawi.com/journals/jat/2021/8840516/</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1155/2021/8840516" target="_blank" >10.1155/2021/8840516</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

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

  • Original language description

    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.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

  • CEP classification

  • OECD FORD branch

    20104 - Transport engineering

Result continuities

  • Project

    <a href="/en/project/EF17_049%2F0008394" target="_blank" >EF17_049/0008394: Cooperation in Applied Research between the University of Pardubice and companies, in the Field of Positioning, Detection and Simulation Technology for Transport Systems (PosiTrans)</a><br>

  • Continuities

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

Others

  • Publication year

    2021

  • Confidentiality

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

Data specific for result type

  • Name of the periodical

    Journal of Advanced Transportation

  • ISSN

    0197-6729

  • e-ISSN

  • Volume of the periodical

    2021

  • Issue of the periodical within the volume

    nečíslováno

  • Country of publishing house

    GB - UNITED KINGDOM

  • Number of pages

    22

  • Pages from-to

  • UT code for WoS article

    000641739600001

  • EID of the result in the Scopus database