Solving logistic tasks by parallelizing algorithms of the theory of direct decompositions of torsion-free abelian groups

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.