Reflective Nested Simulations Supporting Optimizations within Sequential Railway Traffic Simulators

Result code in IS VaVaI

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

Result on the web

<a href="https://dl.acm.org/doi/10.1145/3467965" target="_blank" >https://dl.acm.org/doi/10.1145/3467965</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1145/3467965" target="_blank" >10.1145/3467965</a>

Result language

angličtina

Original language name

Reflective Nested Simulations Supporting Optimizations within Sequential Railway Traffic Simulators

Original language description

This article describes and discusses railway-traffic simulators that use reflective nested simulations. Such simulations support optimizations (decision-making) with a focus on the selection of the most suitable solution where selected types of traffic problems are present. This approach allows suspension of the ongoing main simulation at a given moment and, by using supportive nested simulations (working with an appropriate lookahead), assessment of the different acceptable solution variants for the problem encountered-that is, a what-if analysis is carried out. The variant that provides the best predicted operational results (based on a specific criterion) is then selected for continuing the suspended main simulation. The proposed procedures are associated, in particular, with the use of sequential simulators specifically developed for railway traffic simulations. Special attention is paid to parallel computations of replications both of the main simulation and of supportive nested simulations. The concept proposed, applicable to railway trafficmodelling, has the following advantages. First, the solution variants for the existing traffic situation are analyzed with respect to the feasibility of direct monitoring and evaluation of the natural traffic indicators or the appropriate (multi-criterial) function. The indicator values compare the results obtained from the variants being tested. Second, the supporting nested simulations, which potentially use additional hierarchic nesting, can also include future occurrences of random effects (such as train delay), thereby enabling us to realistically assess future traffic in stochastic conditions. The guidelines presented (for exploiting nested simulations within application projects with time constraints) are illustrated on a simulation case study focusing on traffic assessment related to the track infrastructure of a passenger railway station. Nested simulations support decisions linked with dynamic assignments of platform tracks to delayed trains. The use of reflective nested simulations is appropriate particularly in situations in which a reasonable number of admissible variants are to be analyzed within decision-making problem solution. This method is applicable especially to the support of medium-term (tactical) and long-term (strategic) planning. Because of rather high computational and time demands, nested simulations are not recommended for solving shortterm (operative) planning/control problems.

Czech name

—

Czech description

—

Type

J_imp - Article in a specialist periodical, which is included in the Web of Science database

CEP classification

—

OECD FORD branch

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

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)

Publication year

2022

Confidentiality

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

Name of the periodical

ACM Transactions on Modeling and Computer Simulation

ISSN

1049-3301

e-ISSN

1558-1195

Volume of the periodical

32

Issue of the periodical within the volume

1

Country of publishing house

US - UNITED STATES

Number of pages

34

Pages from-to

nestrankovano

UT code for WoS article

000810182300001

EID of the result in the Scopus database

—