Abstract
The paper considers the principles of parallelization at marshalling yards and determines their importance. There are presented the methods for direct decompositions of torsion-free Abelian groups of finite rank. There are applied the concepts of “conditionally linear graphs” depicting railway trains and their characteristics, including “quasi-length”, which characterizes the length of the corresponding “quasi-graph”. There has been formalized a graphical approach to the redistribution of railcars of incoming trains at a marshalling yard for the formation of outgoing trains. The corresponding algorithms have been developed.
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.
