Abstract
We propose a mathematical model for the assignment of locomotives to transport freight trains. We consider various objective functions. One of the optimization objectives in our model is to minimize the number of locomotives involved in transportation by choosing the routes of trains and locomotives given that the daily transportation plan is fulfilled. The model is capable to account for different types of locomotives as well as different types of their technical maintenance. We propose a new heuristic algorithm for finding an approximate solution for this problem. The main tool of the proposed algorithm is a heuristic utility function that takes into account the topology of the railway network, restrictions imposed on the movement of locomotives, and also the need for technical inspection and repair of locomotives. Results of numerical simulation are presented with the example of real data regarding the movement of freight trains on a section of the Moscow Railway. We pay special attention to performing a qualitative analysis of the resulting solution, in particular, in order to reveal the dependencies between the values of the main qualitative characteristics of the motion and coefficients in front of the variables in the utility function. We assume that it is possible to control the total number of locomotives involved by changing the percentage of admissible idle and auxiliary runs.
Article PDF
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Avoid common mistakes on your manuscript.
References
Azanov, V.M., Buyanov, M.V., Gaynanov, D.N., and Ivanov, S.V., Algorithm and Software Development to Allocate Locomotives for Transportation of Freight Trains, Bull. South Ural State Univ., Ser. Math. Modell. Programm. Comput. Software, 2016, vol. 9, no. 4, pp. 73–85.
Kibzun, A.I., Naumov, A.V., and Ivanov, S.V., A Two-Stage Optimization Problem for the Activity of a Railroad Transportation Node, Upravlen. Bol’shimi Sist., 2012, no. 38, pp. 140–160.
Gainanov, D.M., Ivanov, S.V., Kibzun, A.I., and Osokin, A.V., An Optimal Assignment Model for Locomotives for the Construction of Freight Trains, Proc. 4th Intl. Sci.-Tech. Conf. “Intelligent Control Systems on Railroad Transportation,” Moscow: SJC NIIAS, 2015, pp. 45–47.
Azanov, V.M., Buyanov, M.V., Ivanov, S.V., et al., Optimizing a Locomotive Park Intended for Carrying Freight Trains, Proc. 5th Intl. Sci.-Tech. Conf. “Intelligent Control Systems on Railroad Transportation,” Moscow: SJC NIIAS, 2016, pp. 94–96.
Belyi, O.V. and Kokurin, I.M., Organization of Freight Railroad Transportation: Methods of Optimization, Transport RF, 2011, no. 4 (35), pp. 28–30.
Cacchiani, V., Galli, L., and Toth, P., A Tutorial on Non-Periodic Train Timetabling and Platforming Problems, EURO Transport. Logist., 2015, vol. 4, no. 3, pp. 285–320.
Lazarev, A.A. and Musatova, E.G., Integer-Valued Problem Settings for Constructing Railroad Trains and Their Schedules, Upravlen. Bol’shimi Sist., 2012, no. 38, pp. 161–169.
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., 2012.
Floyd, R.W., Algorithm 97—Shortest Path, Commun. ACM, 1962, vol. 5, no. 6.
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © M.V. Buyanov, A.V. Naumov, 2018, published in Avtomatika i Telemekhanika, 2018, No. 9, pp. 143–158.
Rights and permissions
About this article
Cite this article
Buyanov, M.V., Naumov, A.V. Optimizing the Operation of Rolling Stock in Organizing Cargo Transportation at a Railway Network Segment. Autom Remote Control 79, 1661–1672 (2018). https://doi.org/10.1134/S0005117918090102
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0005117918090102