DEVELOPMENT AND SOFTWARE IMPLEMENTATION OF A RAILWAY ROUTING MODEL

  • Arte Panchenko PhD in Computer Sciences, Department of Theoretical and Applied Informatics, V. N. Karazin Kharkiv National University, Ukraine https://orcid.org/0000-0001-5865-6158
  • Iryna Zaretska PhD in Mathematics, Department of Theoretical and Applied Informatics, V. N. Karazin Kharkiv National University, Ukraine https://orcid.org/0000-0001-8747-2737
  • Maryna Vladimirova PhD in Economics specialized in Mathematical Methods in Economics, Department of Theoretical and Applied Informatics, V. N. Karazin Kharkiv National University, Ukraine https://orcid.org/0009-0000-9868-2617
  • Alina Biletska Master, Department of Theoretical and Applied Informatics, V. N. Karazin Kharkiv National University, Ukraine
Keywords: mathematical modeling, linear programming, discrete-event simulation, implementation of mathematical models, transportation efficiency

Abstract

Under current operating conditions of Ukrzaliznytsia, routing strategy and route selection play a key role in ensuring the economic efficiency of freight transportation. At present, routes are predominantly selected according to the shortest-path principle, which minimizes fuel consumption for transportation and reduces the wear of traction units and other rolling stock. Consequently, customers pay the lowest possible delivery cost. However, such routes are typically fixed for a predefined period and do not support dynamic adjustment, which leads to several issues, including the failure to account for the current technical condition of rolling stock on specific sections and their actual congestion levels during transportation. These problems have become particularly acute as a result of the full-scale invasion of Ukraine by the Russian Federation, which caused the destruction of parts of the railway infrastructure, including tracks and bridges, as well as damage to or complete loss of part of the traction rolling stock of Ukrzaliznytsia and other railway operators. At the same time, alternative routing approaches remain insufficiently explored due to the limited number of studies devoted to strategic management of transportation processes. This paper describes the development and implementation of a software model of railway system operations aimed at enabling experimental investigation of various hypotheses regarding alternative routing approaches. This provides a basis for solving a scientific and applied problem of optimizing freight rail transportation through the design of flexible management strategies. The study is based on a synthesis of graph theory (representation of the network as a weighted multidigraph), discrete-event simulation (DES) for analyzing process dynamics, and mixed-integer linear programming (MILP) for generating benchmark performance indicators. A hybrid threshold-based dispatching policy is implemented, relying on parameters of minimum train fill level and maximum waiting time, thereby balancing node capacity utilization and delivery times. A specialized simulation framework has been developed in Python that integrates the event lifecycle (Spawn, Form, Depart, Arrive) and enables testing of intelligent control strategies in a simulated environment. The practical significance of the research lies in the possibility of using the developed toolkit for quantitative evaluation of different routing and train formation strategies at classification yards. The created software complex serves as a fundamental platform for further research aimed at minimizing average rolling stock turnaround time and node-related dispatch delays in real logistics systems, thereby improving the economic efficiency of freight transportation.

Downloads

Download data is not yet available.

References

Cargo transportation rules :JSC "Ukrzaliznytsia". [in Ukranian] https://www.uz.gov.ua/cargo_transportation/legal_documents/terms_of_freight/

Cargo transportation rules. Chapter 17 Rules for the carriage of goods by the sender's routes: JSC "Ukrzaliznytsia". [in Ukranian] https://www.uz.gov.ua/cargo_transportation/legal_documents/terms_of_freight/264782/

Ahuja, R., Magnanti, T. and Orlin, J. (1993) Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Upper Saddle River. https://books.google.com.ua/books/about/Network_Flows.html?id=WnZRAAAAMAAJ&redir_esc=y

Kurant, M., & Thiran, P. (2006). Extraction and analysis of traffic and topologies of transportation networks. Physical Review E, 74(3).https://doi.org/10.1103/PhysRevE.74.036114

Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2009). Introduction to Algorithms (3rd ed.). MIT Press. https://www.cs.mcgill.ca/~akroit/math/compsci/Cormen%20Introduction%20to%20Algorithms.pdf

Gallo, G., Longo, G., Pallottino, S., & Nguyen, S. (1993). Directed hypergraphs and applications. Discrete Applied Mathematics, 42(2–3), 177–201.https://doi.org/10.1016/0166-218X(93)90045-P

Luteberget, B., Claessen, K., Johansen, C. et al. SAT modulo discrete event simulation applied to railway design capacity analysis. Form Methods Syst Des 57, 211–245 (2021). https://doi.org/10.1007/s10703-021-00368-2

Published
2025-12-30
Cited
How to Cite
Panchenko, A., Zaretska, I., Vladimirova, M., & Biletska, A. (2025). DEVELOPMENT AND SOFTWARE IMPLEMENTATION OF A RAILWAY ROUTING MODEL. Computer Science and Cybersecurity, (2), 51-68. https://doi.org/10.26565/2519-2310-2025-2-05
Section
Статті