<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.3 20210610//EN" "JATS-journalpublishing1-3.dtd">
<article article-type="research-article" dtd-version="1.3" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xml:lang="ru"><front><journal-meta><journal-id journal-id-type="publisher-id">vrgup</journal-id><journal-title-group><journal-title xml:lang="ru">Вестник Ростовского государственного университета путей сообщения</journal-title><trans-title-group xml:lang="en"><trans-title>Vestnik Rostovskogo gosudarstvennogo universiteta putej soobŝeniâ</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">0201-727X</issn><publisher><publisher-name>Ростовский государственный университет путей сообщения</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.46973/0201-727X_2026_2_21</article-id><article-id custom-type="elpub" pub-id-type="custom">vrgup-326</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research Article</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="ru"><subject>МОДЕЛИРОВАНИЕ СИСТЕМ И ПРОЦЕССОВ</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="en"><subject>MODELING SYSTEMS AND PROCESSES</subject></subj-group></article-categories><title-group><article-title>Многокритериальная задача размещения ремонтных участков специального самоходного подвижного состава: мультипериодическая постановка и эквивалентность задаче о потоке минимальной стоимости</article-title><trans-title-group xml:lang="en"><trans-title>The multi-criteria task of locating repair sites for special self-propelled rolling stock: multiperiodic formulation and equivalence to the minimum cost flow problem</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Лохматов</surname><given-names>А. А.</given-names></name><name name-style="western" xml:lang="en"><surname>Lokhmatov</surname><given-names>A. A.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Лохматов Алексей Анатольевич, заместитель главного инженера, Центральная дирекция инфраструктуры</p><p>г. Москва</p></bio><bio xml:lang="en"><p>Lokhmatov Alexey Anatolyevich, Deputy Chief Engineer, Central Directorate of Infrastructure</p><p>Moscow</p></bio><email xlink:type="simple">lokhmatov@bk.ru</email><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru"><institution>Открытое акционерное общество «Российские железные дороги» (ОАО «РЖД»)</institution><country>Россия</country></aff><aff xml:lang="en"><institution>Open Joint Stock Company “Russian Railways” (JSC “RZD”)</institution><country>Russian Federation</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2026</year></pub-date><pub-date pub-type="epub"><day>29</day><month>07</month><year>2026</year></pub-date><volume>0</volume><issue>2</issue><fpage>21</fpage><lpage>29</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Лохматов А.А., 2026</copyright-statement><copyright-year>2026</copyright-year><copyright-holder xml:lang="ru">Лохматов А.А.</copyright-holder><copyright-holder xml:lang="en">Lokhmatov A.A.</copyright-holder><license xml:lang="ru" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>Данная работа распространяется под лицензией Creative Commons Attribution 4.0.</license-p></license><license xml:lang="en" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>This work is licensed under a Creative Commons Attribution 4.0 License.</license-p></license></permissions><self-uri xlink:href="https://vestnik.rgups.ru/jour/article/view/326">https://vestnik.rgups.ru/jour/article/view/326</self-uri><abstract><p>Рассматривается задача размещения, специализации и развития сети ремонтных участков специального самоходного подвижного состава как пространственно-распределённого комплекса инфраструктуры железнодорожного транспорта. Обоснована актуальность поставленной задачи. Предложена формальная постановка задачи размещения в мультипериодической форме, отличающаяся одновременным учётом бинарного фильтра допусков, порога рентабельности загрузки производственного участка и явной оси периодов планирования, что позволяет описать сезонную неравномерность ремонтной кампании. Доказана эквивалентность данной задачи (при освобождении от бинарных переменных активации) задаче о потоке минимальной стоимости на расширенной во времени сети, включение переменных активации и порога рентабельности переводит её к задаче о потоке с фиксированной стоимостью объекта. Операционно-тактический уровень (целочисленное линейное программирование) дополнен стратегическим уровнем многокритериального выбора сценария развития сети методами анализа иерархий и упорядочения по близости к идеальному решению с робастной оценкой по диапазону программы путевых работ. Аппарат апробирован в условиях Восточного полигона ОАО «РЖД». Устойчивым результатом является адресный приоритет развития восточной части сети.</p></abstract><trans-abstract xml:lang="en"><p>The paper considers the problem of placement, specialization, and development of a network of repair sites for special self-propelled rolling stock as a spatially distributed complex of railway transport infrastructure. The relevance of the task is substantiated. A formal formulation of the placement problem in a multi-period form is proposed, which differs from the previous one by simultaneously considering a binary tolerance filter, the profitability threshold for the production site, and an explicit axis of planning periods, which allows for the description of seasonal unevenness in the repair campaign. The equivalence of the problem (when the binary activation variables are removed) to the minimum cost flow problem on a time-extended network is proven, and the inclusion of activation variables and the breakeven point transforms it into a problem of minimizing the cost of a flow with a fixed cost of an object. The operational and tactical level (integer linear programming) is complemented by the strategic level of multi-criteria selection of a network development scenario using hierarchical analysis and ordering based on proximity to the ideal solution with robust assessment of the range of the track maintenance program. The approach has been tested under the conditions of the Eastern Polygon of JSC Russian Railways. The sustainable result is the targeted priority for the development of the eastern part of the network.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>размещение ремонтных участков</kwd><kwd>специальный самоходный подвижной состав</kwd><kwd>задача размещения с ограничением мощности</kwd><kwd>мультипериодическая постановка</kwd><kwd>поток минимальной стоимости</kwd><kwd>расширенная во времени сеть</kwd><kwd>метод анализа иерархий</kwd><kwd>метод TOPSIS</kwd><kwd>Восточный полигон</kwd></kwd-group><kwd-group xml:lang="en"><kwd>repair site placement</kwd><kwd>special self-propelled rolling stock</kwd><kwd>capacity-constrained allocation problem</kwd><kwd>multi-period formulation</kwd><kwd>minimum cost flow</kwd><kwd>time-extended network</kwd><kwd>analytic hierarchy process</kwd><kwd>TOPSIS method</kwd><kwd>Eastern Polygon</kwd></kwd-group></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">Hakimi, S. L. Optimum distribution of switching centers in a communication network and some related graph-theoretic problems / S. L. Hakimi // Operations Research. – 1965. – Vol. 13, No. 3. – P. 462–475.</mixed-citation><mixed-citation xml:lang="en">Hakimi, S. L. Optimum distribution of switching centers in a communication network and some related graph-theoretic problems / S. L. Hakimi // Operations Research. – 1965. – Vol. 13, No. 3. – P. 462–475.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Daskin, M. S. Network and discrete location: models, algorithms and applications / M. S. Daskin. – 2nd ed. – Hoboken: Wiley, 2013. – 494 p.</mixed-citation><mixed-citation xml:lang="en">Daskin, M. S. Network and discrete location: models, algorithms and applications / M. S. Daskin. – 2nd ed. – Hoboken: Wiley, 2013. – 494 p.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Discrete location theory / ed. by P. B. Mirchandani, R. L. Francis. – New York: Wiley, 1990. – 555 p.</mixed-citation><mixed-citation xml:lang="en">Discrete location theory / ed. by P. B. Mirchandani, R. L. Francis. – New York: Wiley, 1990. – 555 p.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Location Science / ed. by G. Laporte, S. Nickel, F. Saldanha-da-Gama. – 2nd ed. – Cham: Springer, 2019. – 767 p.</mixed-citation><mixed-citation xml:lang="en">Location Science / ed. by G. Laporte, S. Nickel, F. Saldanha-da-Gama. – 2nd ed. – Cham: Springer, 2019. – 767 p.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Church, R. L. Theoretical and computational links between the p-median, location set-covering, and the maximal covering location problem / R. L. Church, C. S. ReVelle // Geographical Analysis. – 1976. – Vol. 8, No. 4. – P. 406–415.</mixed-citation><mixed-citation xml:lang="en">Church, R. L. Theoretical and computational links between the p-median, location set-covering, and the maximal covering location problem / R. L. Church, C. S. ReVelle // Geographical Analysis. – 1976. – Vol. 8, No. 4. – P. 406–415.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">ReVelle, C. S. Location analysis: a synthesis and survey / C. S. ReVelle, H. A. Eiselt // European Journal of Operational Research. – 2005. – Vol. 165, No. 1. – P. 1–19.</mixed-citation><mixed-citation xml:lang="en">ReVelle, C. S. Location analysis: a synthesis and survey / C. S. ReVelle, H. A. Eiselt // European Journal of Operational Research. – 2005. – Vol. 165, No. 1. – P. 1–19.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Optimum location analysis for an infrastructure maintenance depot in urban railway networks / Eu Wang Kim, Seok Kim // KSCE Journal of Civil Engineering. – 2021. – DOI: 10.1007/s12205-021-1496-5.</mixed-citation><mixed-citation xml:lang="en">Optimum location analysis for an infrastructure maintenance depot in urban railway networks / Eu Wang Kim, Seok Kim // KSCE Journal of Civil Engineering. – 2021. – DOI: 10.1007/s12205-021-1496-5.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Tönissen, D. D. The maintenance location choice problem for railway rolling stock: Preprint / D. D. Tönissen, J. J. Arts. – 2020. – URL: https://arxiv.org/abs/2012.04565 (date of access: 25.05.2026).</mixed-citation><mixed-citation xml:lang="en">Tönissen, D. D. The maintenance location choice problem for railway rolling stock: Preprint / D. D. Tönissen, J. J. Arts. – 2020. – URL: https://arxiv.org/abs/2012.04565 (date of access: 25.05.2026).</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Ford, L. R. Flows in Networks / L. R. Ford, D. R. Fulkerson. – Princeton: Princeton University Press, 1962. – 194 p.</mixed-citation><mixed-citation xml:lang="en">Ford, L. R. Flows in Networks / L. R. Ford, D. R. Fulkerson. – Princeton: Princeton University Press, 1962. – 194 p.</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Саати, Т. Принятие решений. Метод анализа иерархий / Т. Саати ; пер. с англ. Р. Г. Вачнадзе. – Москва: Радио и связь, 1993. – 278 с.</mixed-citation><mixed-citation xml:lang="en">Saaty, T. Decision making. The Analytic hierarchy process / T. Saaty ; translated from English by R. G. Vachnadze. – Moscow: Radio i Svyaz, 1993. – 278 p.</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Hwang, C. L. Multiple attribute decision making: methods and applications. A state-of-the-art survey / C.-L. Hwang, K. Yoon // Lecture Notes in Economics and Mathematical Systems. – Vol. 186. – Berlin; Heidelberg: Springer-Verlag, 1981.</mixed-citation><mixed-citation xml:lang="en">Hwang, C. L. Multiple attribute decision making: methods and applications. A state-of-the-art survey / C.-L. Hwang, K. Yoon // Lecture Notes in Economics and Mathematical Systems. – Vol. 186. – Berlin; Heidelberg: Springer-Verlag, 1981.</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Melo, M. T. Facility location and supply chain management: a review / M. T. Melo, S. Nickel, F. Saldanha-da-Gama // European Journal of Operational Research. – 2009. – Vol. 196, No. 2. – P. 401–412.</mixed-citation><mixed-citation xml:lang="en">Melo, M. T. Facility location and supply chain management: a review / M. T. Melo, S. Nickel, F. Saldanha-da-Gama // European Journal of Operational Research. – 2009. – Vol. 196, No. 2. – P. 401–412.</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">Единые правила технической эксплуатации и ремонта специального самоходного подвижного состава: распоряжение ОАО «РЖД» от 27.12.2024 № 3341/р. – Москва, 2024. – 312 с.</mixed-citation><mixed-citation xml:lang="en">Uniform rules for the technical operation and repair of special self-propelled rolling stock: Order of JSC Russian Railways dated 12/27/2024 No. 3341/r. – Moscow, 2024. – 312 p.</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">Положение о системе планово-предупредительного ремонта специального подвижного состава: распоряжение ОАО «РЖД» от 14.03.2014 № 659/р (с изменениями от 13.03.2026). – Москва, 2014. – URL: https://legalacts.ru/doc/rasporjazhenie-oao-rzhd-ot-19122016-n-2585r-ob-utverzhdenii/ (дата обращения: 12.06.2026).</mixed-citation><mixed-citation xml:lang="en">Regulations on the system of scheduled preventive maintenance of special rolling stock: Order of JSC Russian Railways dated 03/14/2014 No. 659/r (as amended on 13.03.2026). – Moscow, 2014. – URL: https://legalacts.ru/doc/rasporjazhenie-oao-rzhd-ot-19122016-n-2585r-ob-utverzhdenii/ (date of access: 06/12/2026).</mixed-citation></citation-alternatives></ref></ref-list><fn-group><fn fn-type="conflict"><p>The authors declare that there are no conflicts of interest present.</p></fn></fn-group></back></article>
