DocumentCode :
1767304
Title :
Train routing at railway stations
Author :
Branishtov, S.A. ; Shirvanyan, A.M. ; Tumchenok, D.A.
Author_Institution :
Lab. 3 “Logical Control Syst.”, Inst. of Control Sci., Moscow, Russia
fYear :
2014
fDate :
16-18 Oct. 2014
Firstpage :
1
Lastpage :
6
Abstract :
In order to automate train traffic control, the problem of routes finding has been investigated. At large stations the number of all possible routes is high and the amount of computation is largewhen searchingforit. To reduce thisamountthe method of division of stationshas been proposed. Then the problem of finding the places of cuts of the network graph, taking into account the traffic rules, hasbeen set. The algorithm for solving of this problem has been proposed.
Keywords :
network theory (graphs); rail traffic control; railways; network graph; railway station; routes finding; traffic rules; train routing; train traffic control; Automation; capacity of railway network; graph theory; maximum flow; simulation; train routing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Mechanical Engineering, Automation and Control Systems (MEACS), 2014 International Conference on
Conference_Location :
Tomsk
Print_ISBN :
978-1-4799-6220-4
Type :
conf
DOI :
10.1109/MEACS.2014.6986891
Filename :
6986891
Link To Document :
بازگشت