Abstract
ABSTRACT Formation of multi-group trains is aimed at arranging their cars in a given order and is one of the mass operations performed at railway. In this regard, the reduction of the duration of shunting operations for the formation of multi-group trains is an urgent task for railway transport. In this paper, for a discrete deterministic-controlled system that simulates the operation of the flat yard, a mathematical statement of the problem of choosing the optimal order of multi-group train formation is obtained. The set of possible states of the system under study and the transitions between them are presented in the form of directed graph, which made it possible to reduce the problem of choosing the order of train formation to the problem of searching the shortest paths on the graph. An algorithm of searching the optimal order of train formation is proposed.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
