<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE root>
<article 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" xmlns:ali="http://www.niso.org/schemas/ali/1.0/" article-type="research-article" dtd-version="1.2" xml:lang="en"><front><journal-meta><journal-id journal-id-type="publisher-id">Journal of Computer and System Sciences International</journal-id><journal-title-group><journal-title xml:lang="en">Journal of Computer and System Sciences International</journal-title><trans-title-group xml:lang="ru"><trans-title>Известия Российской академии наук. Теория и системы управления</trans-title></trans-title-group></journal-title-group><issn publication-format="print">0002-3388</issn><issn publication-format="electronic">3034-6444</issn><publisher><publisher-name xml:lang="en">The Russian Academy of Sciences</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="publisher-id">699204</article-id><article-id pub-id-type="doi">10.7868/S3034543X25060106</article-id><article-categories><subj-group subj-group-type="toc-heading" xml:lang="en"><subject>SYSTEM ANALYSIS AND OPERATIONS RESEARCH</subject></subj-group><subj-group subj-group-type="toc-heading" xml:lang="ru"><subject>СИСТЕМНЫЙ АНАЛИЗ И ИССЛЕДОВАНИЕ ОПЕРАЦИЙ</subject></subj-group><subj-group subj-group-type="article-type"><subject>Research Article</subject></subj-group></article-categories><title-group><article-title xml:lang="en">DYNAMIC MODELS OF TRANSPORT RESOURCES MANAGEMENT</article-title><trans-title-group xml:lang="ru"><trans-title>ДИНАМИЧЕСКИЕ МОДЕЛИ УПРАВЛЕНИЯ ТРАНСПОРТНЫМИ РЕСУРСАМИ</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author"><name-alternatives><name xml:lang="en"><surname>Kosorukov</surname><given-names>O. A</given-names></name><name xml:lang="ru"><surname>Косоруков</surname><given-names>О. А</given-names></name></name-alternatives><email>kosorukovoa@mail.ru</email><xref ref-type="aff" rid="aff1"/><xref ref-type="aff" rid="aff2"/><xref ref-type="aff" rid="aff3"/></contrib><contrib contrib-type="author"><name-alternatives><name xml:lang="en"><surname>Mishchenko</surname><given-names>A. V</given-names></name><name xml:lang="ru"><surname>Мищенко</surname><given-names>А. В</given-names></name></name-alternatives><email>alnex4957@rambler.ru</email><xref ref-type="aff" rid="aff4"/></contrib><contrib contrib-type="author"><name-alternatives><name xml:lang="en"><surname>Sviridova</surname><given-names>O. A</given-names></name><name xml:lang="ru"><surname>Свиридова</surname><given-names>О. А</given-names></name></name-alternatives><email>olshan@list.ru</email><xref ref-type="aff" rid="aff3"/></contrib><contrib contrib-type="author"><name-alternatives><name xml:lang="en"><surname>Tsurkov</surname><given-names>V. I</given-names></name><name xml:lang="ru"><surname>Цурков</surname><given-names>В. И</given-names></name></name-alternatives><email>v.isurkov@mail.ru</email><xref ref-type="aff" rid="aff5"/></contrib></contrib-group><aff-alternatives id="aff1"><aff><institution xml:lang="en">Moscow State University named after M. V. Lomonosov</institution></aff><aff><institution xml:lang="ru">МГУ им. М.В. Ломоносова</institution></aff></aff-alternatives><aff-alternatives id="aff2"><aff><institution xml:lang="en">Russian Academy of National Economy and Public Administration under the President of the Russian Federation</institution></aff><aff><institution xml:lang="ru">Российская академия народного хозяйства и государственной службы при Президенте РФ</institution></aff></aff-alternatives><aff-alternatives id="aff3"><aff><institution xml:lang="en">Federal State Budgetary Educational Institution of Higher Education “Plekhanov Russian University of Economics”</institution></aff><aff><institution xml:lang="ru">ФГБОУ ВО “РЭУ им. Г.В. Плеханова”</institution></aff></aff-alternatives><aff-alternatives id="aff4"><aff><institution xml:lang="en">FGOBU VO “Financial University under the Government of the Russian Federation”</institution></aff><aff><institution xml:lang="ru">ФГОБУ ВО “Финансовый университет при Правительстве Российской Федерации”</institution></aff></aff-alternatives><aff-alternatives id="aff5"><aff><institution xml:lang="en">Federal Research Center “Computer Science and Control” Russian Academy of Sciences</institution></aff><aff><institution xml:lang="ru">ФИЦ НУ РАН</institution></aff></aff-alternatives><pub-date date-type="pub" iso-8601-date="2025-12-15" publication-format="electronic"><day>15</day><month>12</month><year>2025</year></pub-date><issue>6</issue><issue-title xml:lang="en">NO6 (2025)</issue-title><issue-title xml:lang="ru">№6 (2025)</issue-title><fpage>108</fpage><lpage>129</lpage><history><date date-type="received" iso-8601-date="2025-12-23"><day>23</day><month>12</month><year>2025</year></date></history><permissions><copyright-statement xml:lang="en">Copyright ©; 2025, Russian Academy of Sciences</copyright-statement><copyright-statement xml:lang="ru">Copyright ©; 2025, Российская академия наук</copyright-statement><copyright-year>2025</copyright-year><copyright-holder xml:lang="en">Russian Academy of Sciences</copyright-holder><copyright-holder xml:lang="ru">Российская академия наук</copyright-holder><ali:free_to_read xmlns:ali="http://www.niso.org/schemas/ali/1.0/" start_date="2026-12-22"/></permissions><self-uri xlink:href="https://rjsvd.com/0002-3388/article/view/699204">https://rjsvd.com/0002-3388/article/view/699204</self-uri><abstract xml:lang="en"><p>In modern conditions, methods of organizing transportation that allow the most rational use of available transport resources are becoming especially relevant. Taking this into account, this paper proposes models for managing urban passenger transport taking into account restrictions on existing transport capacities and passenger flow intensity. One of these models is to distribute a limited fleet of buses over a finite number of routes, while minimizing the total time lost waiting for transport service or minimizing the number of passengers whose transport service time exceeds the critical one. The article presents mathematical formulations of these problems and methods for solving them.</p></abstract><trans-abstract xml:lang="ru"><p>В современных условиях приобретают особую актуальность методы организации перевозок, позволяющие наиболее рационально использовать имеющиеся транспортные ресурсы. С учетом этого предлагаются модели управления городским пассажирским транспортом при ограничении на существующие транспортные мощности и интенсивности пассажиропотоков. Одна из таких моделей заключается в том, чтобы распределить ограниченный парк автобусов по конечному числу маршрутов, минимизируя при этом общие потери времени на ожидание транспортного обслуживания или количество пассажиров, время на транспортное обслуживание которых превышает критическое. Приведены математические постановки этих задач и методы их решения.</p></trans-abstract><kwd-group xml:lang="en"><kwd>transport transportation</kwd><kwd>passenger flow</kwd><kwd>service time</kwd><kwd>arrival intensity</kwd><kwd>service intensity</kwd></kwd-group><kwd-group xml:lang="ru"><kwd>транспортные перевозки</kwd><kwd>пассажиропоток</kwd><kwd>время обслуживания</kwd><kwd>интенсивность поступления</kwd><kwd>интенсивность обслуживания</kwd></kwd-group><funding-group><funding-statement xml:lang="ru">Исследование выполнено за счет гранта Российского научного фонда (проект № 24-21-00339), https://rscf.ru/project/24-21-00339/.</funding-statement></funding-group></article-meta></front><body></body><back><ref-list><ref id="B1"><label>1.</label><mixed-citation>Jayanthi G., Jothilakshmi P. Traffic Time Series Forecasting on Highways – a Contemporary Survey of Models, Methods and Techniques // Intern. J. of Logistics Systems and Management. 2021. V. 39(1). P. 77–110.</mixed-citation></ref><ref id="B2"><label>2.</label><mixed-citation>El Fouh M.A., Sefani N., Fouxka M. Collaborative Transportation and Urban Routing Problems: State of Classification and Literature // Intern. J. of Logistics Systems and Management. 2020. V. 35. № 3. P. 289–328.</mixed-citation></ref><ref id="B3"><label>3.</label><mixed-citation>Ansorena Inigo L., Valdecanos V.N. The Port of Valencia Maritime Network: an Analysis of Centralities and Tree-optimisation // Intern. J. of Logistics Systems and Management. 2021. V. 39(1). P. 127–139.</mixed-citation></ref><ref id="B4"><label>4.</label><mixed-citation>Rahmannyoy F., Razmi J., Yu A.J. An Interactive Multi-objective Fuzzy Linear Programming Model for Hub Location Problems to Minimise Cost and Delay Time in a Distribution Network // Intern. J. of Logistics Systems and Management. 2020. V. 37. № 1. P. 79–105.</mixed-citation></ref><ref id="B5"><label>5.</label><mixed-citation>Kumapopadeelet S., Klinzisuk R. Determination of Green Vehicle Routing Problem via Differential Evolution // Intern. J. of Logistics Systems and Management. 2019. V.34. № 3. P. 395–410.</mixed-citation></ref><ref id="B6"><label>6.</label><mixed-citation>Wen X., Ma H.-L., Chung S.-H., Khan W.A. Robust Airline Crew Scheduling with Flight Flying Time Variability // Transp. Res. Pt E: Logistics and Transportation Review. 2020. V. 144.</mixed-citation></ref><ref id="B7"><label>7.</label><mixed-citation>Suwamong T., Sopadang A. The Impact of Delay Affecting Airport Efficiency: Sustainability Perspective // Intern. J. of Logistics Systems and Management. 2020. V. 37(4). P. 445–464.</mixed-citation></ref><ref id="B8"><label>8.</label><mixed-citation>Yang H., Tang Y. Managing Rail Transit Peak-hour Congestion with a Fare-reward Scheme // Transp. Res. Pt B. 218. V. 110. P. 122–136.</mixed-citation></ref><ref id="B9"><label>9.</label><mixed-citation>Kamel I., Shalaby A., Abdullah B. A Modelling Platform for Optimizing Time-dependent Transit Fares in Large-scale Multimodal Networks // Transport Policy. 2020. V. 92. P. 38–54.</mixed-citation></ref><ref id="B10"><label>10.</label><mixed-citation>Peer S., Knockaerta J., Verhoef V.T. Train Commuters’ Scheduling Preferences: Evidence from a Large-scale Peak Avoidance Experiment // Transp. Res. Pt B: Methodological. 2016. V. 83. P. 314–333.</mixed-citation></ref><ref id="B11"><label>11.</label><mixed-citation>Hadas Y., Shmaiderman M. Public-transit Frequency Setting Using Minimum-cost Approach with Stochastic Demand and Travel Time // Transp. Res. Pt B: Methodological. 2012. V. 46. Iss. 8. P. 1068–1084.</mixed-citation></ref><ref id="B12"><label>12.</label><mixed-citation>Verbas I.O., Mahmassani H.S. Optimal Allocation of Service Frequencies over Transit Network Routes and Time Periods: Formulation, Solution, and Implementation Using Bus Route Patterns // Transp. Res. 2013. Rec. 2334 (1). P. 50–59.</mixed-citation></ref><ref id="B13"><label>13.</label><mixed-citation>Verbas I.O., Mahmassani H.S. Integrated Frequency Allocation and User Assignment in Multi-modal Transit Networks: Methodology and Application to Large-scale Urban Systems // Transp. Res. 2015. Rec. 2498. P. 37–45.</mixed-citation></ref><ref id="B14"><label>14.</label><mixed-citation>An Q., Fu X., Huang D., Cheng Q., Liu Z. Analysis of Adding-runs Strategy for Peak-hour Regular Bus Services // Transp. Res. Pt E: Logistics and Transp. Rev., Elsevier. 2020. V. 143(C).</mixed-citation></ref><ref id="B15"><label>15.</label><mixed-citation>Kosovikov O. Optimization Problems of Transportation in Communication Networks with Variable Capacities // J. of Computer and Systems Sciences International. 2016. V. 55. № 6. P. 1010–1015.</mixed-citation></ref><ref id="B16"><label>16.</label><mixed-citation>Narayanaswami S. Optimal Allocation of Rolling Stock in Scheduled Transportation Services // Intern. J. of Logistics Systems and Management. 2019. V.34. № 3. P.327351.</mixed-citation></ref><ref id="B17"><label>17.</label><mixed-citation>Xie J., Wong S.C., Zhan S., Lo S.M., &amp; Chen A. Train Schedule Optimization Based on Schedule-based Stochastic Passenger Assignment // Transp. Res. Pt E: Logistics and Transportation Review. 2020. V. 136.</mixed-citation></ref><ref id="B18"><label>18.</label><mixed-citation>Мищенко А.В. Устойчивость решений в задаче перераспределения транспортных средств в случае экстренного закрытия движения на участке метрополитена // Изв. АН СССР. Техн. кибернетика. 1990. № 3.</mixed-citation></ref><ref id="B19"><label>19.</label><mixed-citation>Мищенко А.В., Капюхана О.А. Компенсационное перераспределение транспортных средств при сбоях в работе городского трамвая // Логистика сегодня. 2015. № 1 (67). С. 20–36.</mixed-citation></ref><ref id="B20"><label>20.</label><mixed-citation>Мищенко А.В., Капюхана О.А. Динамические модели управления транспортными ресурсами на примере организации работы автобусного парка // Аудит и финансовый анализ. 2016. № 2. С. 156–167.</mixed-citation></ref><ref id="B21"><label>21.</label><mixed-citation>Mishchenko A.V., Kosovakov O.A., Sviridova O.A. Dynamic Models of Transport Resources Management // Intern. J. of Logistics Systems and Management. 2023. V. 46. № 4. P. 518–546.</mixed-citation></ref><ref id="B22"><label>22.</label><mixed-citation>Мищенко А.В. Задача распределения транспортных средств по автобусным маршрутам при неточно заданной матрице корреспонденций пассажиропотока // Изв. АН СССР. Техн. кибернетика. 1992. № 2.</mixed-citation></ref><ref id="B23"><label>23.</label><mixed-citation>Miromov A.A., Tsurkov V.I. Transport-type Problems with the Minimax Criterion // AnT. 1995. № 12. P. 109–118.</mixed-citation></ref><ref id="B24"><label>24.</label><mixed-citation>Миронов А.А., Цурков В.И. Наследственно минимальные матрицы в моделях транспортного типа // Изв. РАН. ТиСУ. 1998. № 6. С. 104–121.</mixed-citation></ref><ref id="B25"><label>25.</label><mixed-citation>Miromov A.A., Levkina T.A., Tsurkov V.I. Minimax Estimations of Expectates of Are Weights in Integer Networks with Fixed Node Degrees // Applied and Computational Mathematics. 2009. Т. 8. № 2. P. 216–226.</mixed-citation></ref><ref id="B26"><label>26.</label><mixed-citation>Tizik A.P., Tsurkov V.I. Iterative Functional Modification Method for Solving a Transportation Problem // Automation and Remote Control. 2012. V. 73. № 1. P. 134–143.</mixed-citation></ref><ref id="B27"><label>27.</label><mixed-citation>Miromov A.A., Tsurkov V.I. Hereditarily Minimax Matrices in Models of Transportation Type // J. Computer and Systems Sciences International. 1998. V. 37. № 6. P. 927–944.</mixed-citation></ref><ref id="B28"><label>28.</label><mixed-citation>Miromov A.A., Tsurkov V.I. Minimax in Transportation Models with Integral Constraints. I // J. Computer and Systems Sciences International. 2003. V. 42. № 4. P. 562–574.</mixed-citation></ref><ref id="B29"><label>29.</label><mixed-citation>Расписание маршрутов наземного городского транспорта (информация с сайта ГУП “Мосгортранс”) [электронный ресурс]. Режим доступа: http://www.mosgortrans.ru/routes/routes/.</mixed-citation></ref></ref-list></back></article>
