This article is cited in 1 paper

Control the moving objects and navigation

Locomotive assignment graph model for freight traffic on linear section of railway. The problem of finding a maximal independent schedule coverage

L. Yu. Zhilyakova^a, N. A. Kuznetsov^b, V. G. Matiukhin^c, A. B. Shabunin^c, A. K. Takmaz'yan<sup>d

a</sup> V. A. Trapeznikov Institute of Control Sciences of Russian Academy of Sciences, Moscow
^b Kotel'nikov Institute of Radio Engineering and Electronics, Russian Academy of Sciences, Moscow
^c Research and Design Institute of Information, Automation, and Communication, Moscow
^d "Programpark", Moscow

Abstract: The paper is devoted to the formal statement and solution of a problem arising when assigning the locomotives for freight transportation realization in accordance with preset schedule. The goal is to determine whether the number of locomotives is sufficient at a specified initial allocation of them to perform all transport operations. The solution is presented in the form of an algorithm that builds the coverage of the schedule: the complete one, if it exists, or else the partial one being the maximal independent. The theorem is proved on one-to-one correspondence between the existence of the complete coverage and the sufficiency of the number of locomotives.

Keywords: graph model, network flows, locomotive assignment, freight rail transportation.

UDC: 519.178

DOI: 10.25728/pu.2018.3.9