Solving the Task of Forming Trains and Their Schedule for Four Stations Using the Algorithm of Vertex Gluing

Optimisation of logistics processes, including freight transport, is receiving increased attention. This is due to the possibility of reducing costs and, as a consequence, lowering the cost of production and increasing the competitiveness of manufactured products. Many large industrial enterprises have internal rail networks and their own fleet of rolling stock and freight wagons. As a rule, the composition of the park and routes is limited, which allows using combinatorial algorithms when solving the problem of organizing freight transportation. In the paper we consider the task of forming freight trains and routes along the railway network including four stations located in star form. A modified algorithm of vertex gluing which differs by the criterion of gluing determination is used as a solution method. The algorithm and the results of numerical experiment are presented.