Skip to main content
SpringerLink
Log in

Graph Methods for Solving the Unconstrained and Constrained Optimal Assignment Problem for Locomotives on a Single-Line Railway Section

  • ROBUST, ADAPTIVE AND NETWORK CONTROL
  • Published:
Automation and Remote Control Aims and scope Submit manuscript

Abstract

We propose a new graph model of transportation on a single-line railway section. Based on a given freight-train delivery schedule, we construct an acyclic graph with vertices denoting deliveries and arcs indicating the possibility of successive implementation of these deliveries by some locomotive. This model of the problem permits applying static graph algorithms to find an optimal locomotive assignment plan. The search for a solution of the problem without time constraints on the locomotives is reduced to finding a minimal path cover of an acyclic graph. Each path in the cover corresponds to a sequence of deliveries carried out by one locomotive. If there are temporary constraints on the locomotives (maintenance breaks), not all paths in the cover can remain valid: for some locomotives, none of the established delivery sequences can be performed from start to finish. In this case, one more solution stage is added, at which the cover is transformed in such a way that all new paths describe a sequence of deliveries that can be carried out by a given set of locomotives under given time constraints.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1.
Fig. 2.
Fig. 3.
Fig. 4.
Fig. 5.
Fig. 6.
Fig. 7.
Fig. 8.
Fig. 9.
Fig. 10.

Similar content being viewed by others

REFERENCES

  1. Ahuja, R.K., Magnanti, T.L., and Orlin, J.B., Network Flows: Theory, Algorithms, and Applications, Englewood Cliffs: Prentice Hall, 1993.

    MATH  Google Scholar 

  2. Lovász, L. and Plummer, M., Matching Theory, Budapest: Akadémiai Kiadó, 1986. Translated under the title: Prikladnye zadachi teorii grafov. Teoriya parosochetanii v matematike, fizike, khimii, Moscow: Mir, 1998.

    MATH  Google Scholar 

  3. Adel’son-Vel’skii, G.M., Dinits, E.A., and Karzanov, A.V., Potokovye algoritmy (Flow Algorithms), Moscow: Nauka, 1975.

    Google Scholar 

  4. Sedgewick, R., Algorithms in C++, Boston: Addison-Wesley, 1992. Translated under the title: Fundamental’nye algoritmy na C++. Algoritmy na grafakh, St. Petersburg: DiaSoftYuP, 2002.

    MATH  Google Scholar 

  5. Erusalimskii, Ya.M., Skorokhodov, V.A., Kuz’minova, M.V., and Petrosyan, A.G., Grafy s nestandartnoi dostizhimost’yu: zadachi, prilozheniya (Graphs with Nonstandard Reachability: Problems, Applications), Rostov-on-Don: Izd. Yuzhn. Fed. Univ., 2009.

    Google Scholar 

  6. Erusalimskii, Ya.M., Flows in networks with nonstandard reachability, Izv. Vyssh. Uchebn. Zaved. Severo-Kavkaz. Region. Estestv. Nauki, 2012, no. 1, pp. 5–7.

  7. Matyukhin, V.G., Shabunin, A.B., Kuznetsov, N.A., and Takmazian, A.K., Rail transport control by combinatorial optimization approach, 11th IEEE Int. Conf. Appl. Inf. Commun. Technol. (2017), Conf. Proc., 2017, vol. 1, pp. 419–422.

  8. Takmaz’yan, A.K. and Shabunin, A.B., Application of the optimal network flow method to the problem of locomotive selection for freight trains at the Eastern range, Vychislit. Tekhnol., 2018, vol. 23, no. 6, pp. 94–106.

    Google Scholar 

  9. Zhilyakova, L.Yu., Kuznetsov, N.A., Matyukhin, V.G., Shabunin, A.B., and Takmaz’yan, A.K., Graph model of the distribution of locomotives for freight traffic on a linear section of the railway. The problem of inclusion-maximum schedule cover, Probl. Upr., 2018, no. 3, pp. 65–75.

  10. Ahuja, R.K., Liu, J., Orlin, J.B., Sharma, D., and Shughart, L.A., Solving real-life locomotive scheduling problems, Transp. Sci., 2005, vol. 39, no. 4, pp. 503–517.

    Article  Google Scholar 

  11. Jaumard, B. and Tian, H., Multi-column generation model for the locomotive assignment problem, Proc. 16th Workshop Algorithmic Approaches Transp. Model. Optim. Syst. (ATMOS’16) (2016), pp. 6:1–6:13.

  12. Azanov, V.M., Buyanov, M.V., Ivanov, S.V., Kibzun, A.I., and Naumov, A.V., Optimization of the locomotive fleet intended for the transportation of freight trains, Tr. 3-i nauchno-tekh. konf. ISUZhT-2016 (Proc. 3rd Sci.-Tech. Conf. ICSRT-2016) (2016), pp. 94–96.

  13. Lazarev, A.A. and Musatova, E.G., The problem of trains formation and scheduling: integer statements, Autom. Remote Control, 2013, vol. 74, no. 12, pp. 2064–2068.

    Article  MathSciNet  Google Scholar 

  14. Arkhipov, D.I., Lazarev, A.A., and Musatova, E.G., Using the programming method in constraints to solve the problem of assigning locomotives and locomotive crews to freight transportation, Tr. 6-i Mezhdunar. nauchno-tekh. konf. “Intellektual’nye sistemy upravleniya na zheleznodorozhnom transporte” ISUZhT-2017 (Proc. 6th Int. Sci.-Tech. Conf. “Intelligent Control Systems in Railway Transport” ICSRT-2017) (Moscow, 2017), Moscow: OAO NIIAS, 2017, pp. 56–59.

  15. Gainanov, D.N., Kibzun, A.I., and Rasskazova, V.A., The decomposition problem for the set of paths in a directed graph and its application, Autom Remote Control, 2018, vol. 79, pp. 2217–2236.

    Article  MathSciNet  Google Scholar 

  16. Boesch, F.T. and Gimpel, J.F., Covering the points of digraph with point-disjoint paths and its application to code optimization, J. Assoc. Comput. Mach., 1977, vol. 24, no. 2, pp. 192–198.

    Article  MathSciNet  Google Scholar 

  17. Noorvash, Sh., Covering the vertices of a graph by vertex-disjoint paths, Pac. J. Math., 1975, vol. 58, no. 1, pp. 159–168.

    Article  MathSciNet  Google Scholar 

  18. Jackson, B. and Ordaz, O., Chvátal–Erdős conditions for paths and cycles in graphs and digraphs. A survey, Discrete Math., 1990, vol. 84, no. 3, pp. 241–254.

    Article  MathSciNet  Google Scholar 

  19. Chvátal, V. and Erdős, P., A note on Hamiltonian circuits, Discrete Math., 1972, no. 2, pp. 111–113.

  20. Aleskerov, F.T., Habina, E.L., and Schwartz, D.A., Binarnye otnosheniya, grafy i kollektivnye resheniya (Binary Relations, Graphs, and Collective Decisions), Moscow: Fizmatlit, 2012.

    Google Scholar 

  21. Rubchinskii, A.A., Diskretnye matematicheskie modeli. Nachal’nye ponyatiya i standartnye zadachi (Discrete Mathematical Models. Initial Concepts and Standard Problems), Moscow: Direkt-Media, 2014.

    Google Scholar 

  22. Kalyaev, I.A. and Kapustyan, S.G., Multi-agent management method for smart internet production, in Robototekhnika i tekhnicheskaya kibernetika, No. 1 (18) (Robotics and Technical Cybernetics no. 1 (18)), St. Petersburg: TsNII RTK, 2018, pp. 34–48.

    Google Scholar 

Download references

Funding

This work was partly supported by the Russian Foundation for Basic Research (projects nos. 17-20-01180ofi-m-RZhD and 20-07-00190a).

Author information

Authors and Affiliations

  1. Trapeznikov Institute of Control Sciences, Russian Academy of Sciences, Moscow, 117997, Russia

    L. Yu. Zhilyakova

  2. Kotel’nikov Institute of Radio-Engineering and Electronics, Russian Academy of Sciences, Moscow, 125009, Russia

    N. A. Kuznetsov

  3. Moscow Institute of Physics and Technology, Dolgoprudnyi, Moscow oblast, 141700, Russia

    N. A. Kuznetsov

Authors
  1. L. Yu. Zhilyakova
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. N. A. Kuznetsov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to L. Yu. Zhilyakova or N. A. Kuznetsov.

Additional information

Translated by V. Potapchouck

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhilyakova, L.Y., Kuznetsov, N.A. Graph Methods for Solving the Unconstrained and Constrained Optimal Assignment Problem for Locomotives on a Single-Line Railway Section. Autom Remote Control 82, 780–797 (2021). https://doi.org/10.1134/S0005117921050040

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0005117921050040

Keywords

Search

Navigation