Automation and Remote Control

, Volume 79, Issue 12, pp 2217–2236 | Cite as

The Decomposition Problem for the Set of Paths in a Directed Graph and Its Application

  • D. N. GainanovEmail author
  • A. I. Kibzun
  • V. A. Rasskazova
Optimization, System Analysis, and Operations Research


We consider the problem of decomposing the set of paths in a directed graph and its application to reducing the dimension of an applied problem on the assignment and transportation of locomotives. On a given set of paths and a set of strongly connected subgraphs, we define a special table. To solve the graph decomposition problem, we develop a heuristic algorithm based on the idea of quicksorting the constructed table. We estimate of the complexity of the resulting algorithm. The obtained results were used to reduce the dimension of the above-mentioned applied problem. We also show the results of computational experiments.


decomposition directed graph strongly connected graph algorithm locomotive assignment 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Lazarev, A.A., Absolute Error Estimates and an Approximate Solution Scheme for Scheduling Theory Problems, Zh. Vychisl. Mat. Mat. Fiz., 2009, vol. 49, no. 2, pp. 14–34.Google Scholar
  2. 2.
    Lazarev, A.A., Musatova, E.G., Gafarov, E.R., and Kvaratskheliya, A.G., Teoriya raspisanii. Zadachi zheleznodorozhnogo planirovaniya (Scheduling Theory. Railroad Planning Problems), Moscow: Inst. Probl. Upravlen., RAN, 2012.Google Scholar
  3. 3.
    Lazarev, A.A. and Musatova, E.G., Integer-Valued Settings of the Problem of Constructing Railroad Trains and Their Schedules, Upravlen. Bol’shimi Sist., 2012, no. 38, pp. 161–169.Google Scholar
  4. 4.
    Gainanov, D.N. and Rasskazova, V.A., An Inference Algorithm for Monotone Boolean Functions Associated with Undirected Graphs, Bull. SUSU, 2016, no. 9 (3), pp. 17–30.CrossRefzbMATHGoogle Scholar
  5. 5.
    Kuznetsov, N.A., Pashchenko, F.F., Ryabykh, N.G., Zakharova, E.M., and Minashina, I.K., Optimization Algorithms in Planning Problem on Rail Transport, Inform. Prots., 2014, no. 4 (14), pp. 307–318.Google Scholar
  6. 6.
    Takmaz’yan, A.K. and Sheludyakov, A.V., A Multiagent Solution with the Method of Auctions for a Multiproduct Transportation Problem with United Needs, ISUZhT, 2015, no. 1, pp. 110–112.Google Scholar
  7. 7.
    Piu, F. and Speranza, M.G., The Locomotive Assignment Problem: A Survey on Optimization Models, Intl. Trans. Op. Res., 2014, 21, pp. 327–352.Google Scholar
  8. 8.
    Azanov, V.M., Buyanov, M.V., Gainanov, D.N., and Ivanov, S.V., Algorithms and Software for Locomotive Assignment Intended to Transport Freight Trains, Vestn. YuUrGU, Ser. Mat. Modelir. Programmir., 2016, no. 9, pp. 73–85.Google Scholar
  9. 9.
    Ivanov, S.V., Kibzun, A.I., and Osokin, A.V., Stochastic Optimization Model of Locomotive Assignment to Freight Trains, Autom. Remote Control, 2016, vol. 77, no. 11, pp. 1944–1956.MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Matyukhin, V.G., Kuznetsov, N.A., Shabunin, A.B., Zhilyakova, L.Yu., and Takmaz’yan, A.K., Graph DynamicalModel for the Problem of Assigning Tractional Resources for Freight Railroad Transportation, ISUZhT, 2017, Moscow: AO “NIIAS,” 2017, pp. 14–18.Google Scholar
  11. 11.
    Gainanov, D.N., Konygin, A.V., and Rasskazova, V.A., Modelling Railway Freight Traffic Using the Methods of Graph Theory and Combinatorial Optimization, Autom. Remote Control, 2016, vol. 77, no. 11, pp. 1928–1943.MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Matyukhin, V.G., Shabunin, A.B., Kuznetsov, N.A., and Takmazian, A.K., Rail Transport Control by Combinatorial Optimization Approach, 11th Int. Conf. on Application of Information and Communication Technologies, 2017, no. 1, pp. 419–422.Google Scholar
  13. 13.
    Gainanov, D.N., Kibzun, A.I., and Rasskazova, V.A., Vertex Cover Algorithm for a Directed Graph with a Set of Directed Paths in the Optimal Assignment and Locomotive Moving Problem, Vestn. Komp. Informats. Tekhn., 2017, no. 5, pp. 51–56.Google Scholar
  14. 14.
    Tyshkevich, R.I., Suzdal’, S.V., Maksimovich, O.V., and Petrovich, R.A., Algebraic Theory of Graph Decomposition, Vestn. BSU, 2011, no. 1 (3), pp. 126–138.zbMATHGoogle Scholar
  15. 15.
    Dasgupta, S., Papadimitriou, C., and Vazirani, U., Algorithms, Columbus: McGraw-Hill, 2006. Translated under the title Algoritmy, Moscow: MTsNMO, 2014.Google Scholar
  16. 16.
    Korte, B. and Vygen, J., Combinatorial Optimization: Theory and Algorithms, New York: Springer, 2010. Translated under the title Kombinatornaya optimizatsiya. Teoriya i algoritmy, Moscow: MTsNMO, 2015.zbMATHGoogle Scholar
  17. 17.
    Gardiner, E., Willett, P., and Artymiuk, P., Graph-Theoretic Techniques for Macromolecular Docking, J. Chem. Inf. Comput., 2000, no. 40, pp. 273–279.CrossRefGoogle Scholar
  18. 18.
    Bykova, V.V., On a Decomposition of a Hypergraph by Minimal Clique Separators, Zh. Sib. Federal. Univ., 2012, no. 1 (5), pp. 36–45.Google Scholar
  19. 19.
    Harary, F., Graph Theory, London: Addison Wesley, 1969. Translated under the title Teoriya grafov, Moscow: Mir, 1976.Google Scholar
  20. 20.
    Christofides, N., Graph Theory. An Algorithmic Approach, New York: Academic, 1975. Translated under the title Teoriya grafov. Algoritmicheskii podkhod, Moscow: Mir, 1978.zbMATHGoogle Scholar

Copyright information

© Pleiades Publishing, Inc. 2018

Authors and Affiliations

  • D. N. Gainanov
    • 1
    Email author
  • A. I. Kibzun
    • 1
  • V. A. Rasskazova
    • 1
  1. 1.Moscow Aviation Institute (National State University)MoscowRussia

Personalised recommendations