ALGORITHM FOR SIMULATING THE NUMBER AND ORDER OF CARS IN THE TRAIN ARRIVING AT THE ACCESS TRACK

Nazdana Adilova

2021

Full text Open access: Hybrid Metadata (CSL-JSON)
DOI 10.52167/1609-1817-2021-117-2-35-41
Data confidence 70 medium
How this score is calculated

It is built from checkable properties of the record itself: whether the article has a DOI, how many independent sources confirmed its data, whether the required fields are filled in, and how recent the latest confirmation is. Disagreement between sources and a missing identifier lower it. A value of 80 or above means the record was published without further checking; 60 to 79 means it is published at reduced confidence, with a manual check advisable. A record verified by an editor by hand is never pushed below 90 by a recalculation. This scores our data about the article, not the article itself.

Abstract

An algorithm for simulating the number and order of cars in a train arriving at an access track. The paper presents an algorithm for randomly generating the characteristics of trains arriving at the access road. Trains are characterized by the following parameters: the number of uncoupling cars arriving at the internal stations of the access track, the number of cars in each uncoupling, the order of the uncoupling in the train. The number of detachments is formed randomly in the range from one to the value of the total number of internal stations of the access road. The number of cars in each uncoupling is formed randomly from zero to one-third of the size of the train composition. Moreover, the proportionality of the volumes of car traffic going to each station is observed. The number of options for the location of detachments (permutations) is determined by the factorial of the number of stations. The number of the permutation variant is randomly selected.