Abstract
The optimization problem of planning the railway freight traffic was presented, and approaches to reduction of problem dimension by constructing a hierarchy of the problems of train traffic planning were described. The notion of conflict graph on a set of energy-efficient standard threads was introduced. A “traveling wave” algorithm to construct the conflict-free sets of standard threads of the train schedule on the basis of the conflict graph was proposed. The problem of optimal assignments and transportations of locomotives in terms of the minimized number of utilized locomotives was formulated, an algorithm to solve to it was given, and its complexity was estimated.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Akimova, E.N., Gainanov, D.N., Golubev, O.A., et al., The Problem of Scheduling for the Linear Section of a Single-track Railway with Independent Edges Orientations, in 1st Ural Workshop on Parallel, Distributed, and Cloud Computing for Young Scientists. CEUR Workshop Proc., 2015, vol. 1513, pp. 130–136.
Lazarev, A.A., Estimates of Absolute Error and Scheme of Approximate Solutionof the Scheduling Problem, Zh. Vychisl. Mat. Mat. Fiz., 2009, vol. 49, no. 2, pp. 14–34.
Lazarev, A.A. and Gafarov, E.R., Transformation of the Network Graph of the Scheduling Problem with Predecession Restriction, Dokl. Ross. Akad. Nauk, 2008, vol. 424, no. 2, pp. 7–9.
Gholami, O. and Sotskov, Y.N., Scheduling Algorithm with Controllable Train Speeds and Departure Times to Decrease the Total Train Tardiness, Int. J. Indust. Engen. Comput., 2014, vol. 5, pp. 281–294.
Sotskov, Y.N. and Gholami, O., Mixed Graph Model and Algorithms for Parallel-machine Job-shop Scheduling Problems, Int. J. Product. Res., 2015, vol. 8, pp. 1–16.
Burdett, O. and Kozan, E., A Disjunctive Graph Model and Framework for Constructing New Train Schedules, Eur. J. Oper. Res., 2010, vol. 200, pp. 85–98.
Gholami, O., Sotskov, Y.N., and Werner, F., Job-shop Problems with Objectives Appropriate to Train Scheduling in a Single-track Railway, in Proc. 2 Int. Conf. on Simulation and Modeling Methodologies, Technologies and Applications, Roma, Italy, 2012, pp. 425–430.
Lusby, R. and Ryan, D., Railway Track Allocation. Models and Methods, Oper. Res. Spektr., 2011, vol. 33, pp. 843–883.
Efimenko, Yu.I., Obshchii kurs zheleznykh dorog (Railways: A General Course), Moscow: Akademiya, 2005.
Distel’, R., Teoriya grafov (Graph Theory), Novosibirsk: Sobolev Mat. Inst., 2002.
Garey, M.L. and Johnson, D.S., Computers and Intractability: A Guide to the Theory of NP-Completness, San Francisco: Freeman, 1979. Translated under the title Vychislitel’nye mashiny i trudnoreshaemye zadachi, Moscow: Mir, 1982.
Cormen, T.H., Leizerson, C.E., and Rivest, R.L., Introduction to Algorithms, Cambridge: MIT Press, 1990. Translated under the title Algoritmy. Postroenie i analiz, Moscow: Vil’yams, 2005.
Osipov, S.I. and Osipov, S.S., Osnovy tyagi poezdov (Fundamentals of Train Traction), Moscow: UMK MPS, 2000.
Gainanov, D.N., Kombinatornaya geometriya i grafy v analize nesovmestnykh sistem i raspoznavanii obrazov (Combinatorial Geometry and Graphs in the Analysis of Infeasible Systems), Moscow: Nauka, 2014.
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © D.N. Gainanov, A.V. Konygin, V.A. Rasskazova, 2016, published in Avtomatika i Telemekhanika, 2016, No. 11, pp. 60–79.
This paper was recommended for publication by A.A. Lazarev, a member of the Editorial Board
Rights and permissions
About this article
Cite this article
Gainanov, D.N., Konygin, A.V. & Rasskazova, V.A. Modelling railway freight traffic using the methods of graph theory and combinatorial optimization. Autom Remote Control 77, 1928–1943 (2016). https://doi.org/10.1134/S0005117916110047
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0005117916110047