Open AccessFord-Fulkerson algorithm refinement for the cooperation effectiveness increase of intensive and low-density lines
Author(s) -
Konstantin Kovalev,
А. В. Новичихин
Publication year - 2021
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/2131/3/032008
Subject(s) - inverse , computer science , line (geometry) , graph , maximum flow problem , line graph , algorithm , realization (probability) , flow network , mathematical optimization , theoretical computer science , mathematics , statistics , geometry
The article describes tools of the railway control on intensive and low-density lines which is directed on the effectiveness increase of low-density line functioning, for the solution of perspective tasks of the railway network functioning and development. For the too realization the oriented graph with the Ford-Fulkerson algorithm which allows determining the maximum flow and the minimum cut for non-oriented graphs. Firstly as values of graph tops inverse values of the station rating and as graph edges inverse values of the railway line class are accepted. The use of this approach allows determining the maximum flow in the system and provides the clear view of relations of transportation capacities of railway lines and stations.