Vestnik Yuzhno-Ural'skogo Universiteta. Seriya Matematicheskoe Modelirovanie i Programmirovanie
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Vestnik YuUrGU. Ser. Mat. Model. Progr.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Vestnik Yuzhno-Ural'skogo Universiteta. Seriya Matematicheskoe Modelirovanie i Programmirovanie, 2016, Volume 9, Issue 4, Pages 73–85
DOI: https://doi.org/10.14529/mmp160407
(Mi vyuru345)
 

This article is cited in 9 scientific papers (total in 9 papers)

Programming & Computer Software

Algorithm and software development to allocate locomotives for transportation of freight trains

V. M. Azanova, M. V. Buyanova, D. N. Gaynanovb, S. V. Ivanova

a Moscow Aviation Institute, Moscow, Russian Federation
b Ural Federal University, Ekaterinburg, Russian Federation
Full-text PDF (478 kB) Citations (9)
References:
Abstract: We suggest a mathematical model to allocate locomotives for transportation of freight trains. The aim of the optimization in this model is to minimize the number of locomotives used for the transportation of the trains by choosing routes of the trains and locomotives. It is supposed that the trains can be transported only at defined time intervals (so-called train paths); every locomotive has possible routes called railway hauls. We take into account the necessity of periodic maintenance. We use graph theory and integer optimization to formulate the problem. We suggest mathematical definitions of a railway haul, a train path, a train route, and a locomotive route. An heuristic search algorithm to find an approximate solution of the problem is suggested. The main idea of the algorithm is maximal usage of locomotives that started earlier than other ones. The algorithm contains three stages. A solution of the previous stage is improved at each following stage. We use transfers of the locomotives to improve the current solution. We describe software development to optimize the model. We solve the problem using the historical data of Moscow railway.
Keywords: graph theory; integer optimization; allocation of locomotives.
Funding agency Grant number
Russian Science Foundation 16-11-00062
The work has been supported by Russian Science Foundation (project No 16-11-00062).
Received: 01.04.2016
Bibliographic databases:
Document Type: Article
UDC: 519.8:004.42
MSC: 90C35, 90C27
Language: English
Citation: V. M. Azanov, M. V. Buyanov, D. N. Gaynanov, S. V. Ivanov, “Algorithm and software development to allocate locomotives for transportation of freight trains”, Vestnik YuUrGU. Ser. Mat. Model. Progr., 9:4 (2016), 73–85
Citation in format AMSBIB
\Bibitem{AzaBuyGai16}
\by V.~M.~Azanov, M.~V.~Buyanov, D.~N.~Gaynanov, S.~V.~Ivanov
\paper Algorithm and software development to allocate locomotives for transportation of freight trains
\jour Vestnik YuUrGU. Ser. Mat. Model. Progr.
\yr 2016
\vol 9
\issue 4
\pages 73--85
\mathnet{http://mi.mathnet.ru/vyuru345}
\crossref{https://doi.org/10.14529/mmp160407}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000390883900007}
\elib{https://elibrary.ru/item.asp?id=27318768}
Linking options:
  • https://www.mathnet.ru/eng/vyuru345
  • https://www.mathnet.ru/eng/vyuru/v9/i4/p73
  • This publication is cited in the following 9 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024