<?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">creexp</journal-id><journal-title-group><journal-title xml:lang="ru">Crede Experto: транспорт, общество, образование, язык</journal-title><trans-title-group xml:lang="en"><trans-title>Crede Experto: transport, society, education, language</trans-title></trans-title-group></journal-title-group><issn pub-type="epub">2312-1327</issn><publisher><publisher-name>Иркутский филиал ФГБОУ ВО «МГТУ ГА»</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.51955/2312-1327_2025_4_20</article-id><article-id custom-type="elpub" pub-id-type="custom">creexp-173</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></article-categories><title-group><article-title>Управление маршрутной сетью с применением принципов парадокса Браеса</article-title><trans-title-group xml:lang="en"><trans-title>Airway network control through the application of Braess’ Paradox</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><contrib-id contrib-id-type="orcid">https://orcid.org/0009-0007-3917-6256</contrib-id><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Гаспарян</surname><given-names>Г. А.</given-names></name><name name-style="western" xml:lang="en"><surname>Gasparyan</surname><given-names>G. A.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Григорий Арменович Гаспарян, аспирант </p><p>Кронштадтский б-р, 20 Москва, 125493</p></bio><bio xml:lang="en"><p>Grigory A. Gasparyan, postgraduate student</p><p>20, Kronshtadtskiy blvd Moscow, 125493</p></bio><email xlink:type="simple">grigory.rw@gmail.com</email><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><contrib-id contrib-id-type="orcid">https://orcid.org/0009-0004-2434-8594</contrib-id><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Драченко</surname><given-names>Е. А.</given-names></name><name name-style="western" xml:lang="en"><surname>Drachenko</surname><given-names>E. A.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Егор Александрович Драченко, аспирантКронштадтский б-р, 20 Москва, 125493</p></bio><bio xml:lang="en"><p>Egor A. Drachenko, postgraduate student</p><p>20, Kronshtadtskiy blvd Moscow, 125493</p></bio><email xlink:type="simple">egordrachenko@icloud.com</email><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru">Московский государственный технический университет гражданской авиации<country>Россия</country></aff><aff xml:lang="en">Moscow state technical university of civil aviation<country>Russian Federation</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2025</year></pub-date><pub-date pub-type="epub"><day>23</day><month>12</month><year>2025</year></pub-date><volume>0</volume><issue>4</issue><fpage>20</fpage><lpage>43</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Гаспарян Г.А., Драченко Е.А., 2025</copyright-statement><copyright-year>2025</copyright-year><copyright-holder xml:lang="ru">Гаспарян Г.А., Драченко Е.А.</copyright-holder><copyright-holder xml:lang="en">Gasparyan G.A., Drachenko E.A.</copyright-holder><license 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://ce.if-mstuca.ru/jour/article/view/173">https://ce.if-mstuca.ru/jour/article/view/173</self-uri><abstract><p>В работе рассматривается применение парадокса Браеса к оптимизации воздушной сети. На основе разработанной раннее модели подтверждается возможность уменьшения суммарного времени полёта за счёт целенаправленного удаления рёбер из маршрутной сети. Однако статическая постановка задачи ограничивает применимость метода в условиях реальной динамики движения. В данном исследовании предложено расширение подхода за счёт использования динамического назначения движения и метода устойчивого удаления, учитывающего неопределённость спроса. Проведённые численные эксперименты показывают, что удаление определённых рёбер может приводить к устойчивому снижению задержек даже при изменяющемся объёме движения. Разработанный подход может быть использован для стратегического управления воздушным пространством с учётом временной динамики и ограничений пропускной способности.</p></abstract><trans-abstract xml:lang="en"><p>The paper explores the application of Braess’s Paradox to the optimization of air traffic networks. Building upon the model proposed earlier, it is confirmed that removing specific edges from the route structure can reduce overall flight time. However, the original static formulation limits its applicability under real-world dynamic traffic conditions. An extended framework incorporating Dynamic Traffic Assignment and robust removal methods that account for demand uncertainty are proposed. Simulation results demonstrate that eliminating certain edges consistently leads to reduced delays, even under fluctuating traffic scenarios. The developed approach offers a practical tool for strategic airspace management, enabling resilient network reconfiguration under dynamic and capacity-constrained environments.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>проектирование маршрутных сетей</kwd><kwd>парадокс Браеса</kwd><kwd>перегрузка воздушного пространства</kwd></kwd-group><kwd-group xml:lang="en"><kwd>airway network design</kwd><kwd>Braess’s Paradox</kwd><kwd>air traffic congestion</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">Веремей Е.И. Алгоритмы оптимизации маршрутов движения с учётом погодных условий / Е. И. Веремей, М. В. Сотникова //International Journal of Open Information Technologies. 2016. 4(3). С. 45-53. EDN VOQQTD</mixed-citation><mixed-citation xml:lang="en">Bertsimas D., Patterson S.S. (2000). The air traffic flow management problem with enroute capacities. Operations Research.48(1): 156-168.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Елисеев Б. П. Влияние интенсивности воздушного движения на задержки рейсов / Б. П. Елисеев, В. В. Воробьев, А. С. Харламов //Мир транспорта. 2016. Т. 14, № 4. С. 168- 175. EDNYISBHB</mixed-citation><mixed-citation xml:lang="en">Bittihn S., Schadschneider A. (2021). The effect of modern traffic information on Braess’ paradox.Physica A: Statistical Mechanics and its Applications.571: 125829.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Печенежский В.К. Особенности организации планирования использования воздушного пространства в Российской Федерации на примере Московской воздушной зоны / В. К. Печенежский, Е. К. Чувиковская //Научный вестник МГТУ ГА. 2023. 26(6). С. 47-57. EDNVJOFJZ</mixed-citation><mixed-citation xml:lang="en">Burov M., Kizilkale C., Kurzhanskiy A., Arcak M. (2021). Detecting Braess Routes: an Algorithm Accounting for Queuing Delays With an Extended Graph. IEEE Intelligent Transportation Systems Conference (ITSC). 2125-2130.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Applying complexity science to air traffic management / A. Cook, H. Blom, F. Lillo, R. Mantegna, S. Miccichè, S. Rivas, R. Vázquez, M. Zanin // Journal of Air Transport Management.2015. Vol. 42. P. 149-158. DOI 10.1016/j.jairtraman.2014.09.011.</mixed-citation><mixed-citation xml:lang="en">Cook A. J., Blom H., Lillo F., Mantegna R., Miccichè S., Rivas S., Vázquez R., Zanin M. (2015). Applying complexity science to air traffic management. Journal of Air Transport Management.42: 149-158.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Bertsimas D. The air traffic flow management problem with enroute capacities /D. Bertsimas, S. Patterson// Operations Research. 1998.46(3).pp. 406-422.DOI DOI: 10.1287/opre.46.3.406</mixed-citation><mixed-citation xml:lang="en">Cook A., Tanner G., Williams V., Meise G. (2009). Dynamic cost indexing – Managing airline delay costs. Journal of Air Transport Management.15(1): 26-35.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Bittihn S. The effect of modern traffic information on Braess’ paradox /S. Bittihn, A. Schadschneider // Physica A: Statistical Mechanics and its Applications. 2021.571. 125829. DOI 10.1016/j.physa.2021.125829.</mixed-citation><mixed-citation xml:lang="en">Eliseev B.P., Vorobyev V.V., Kharlamov A. S. (2016). Influence of air traffic on flight delays. Mir transporta.14 (4):168-175.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Detecting Braess Routes: an Algorithm Accounting for Queuing Delays With an Extended Graph / M. Burov, C. Kizilkale, A. Kurzhanskiy, M. Arcak// Intelligent Transportation Systems Conference (ITSC). 2021. Pp. 2125-2130. DOI 10.1109/ITSC48978.2021.9564775.</mixed-citation><mixed-citation xml:lang="en">Eurocontrol manual for airspace planning. Common guidelines. Second Edition / European organization for the safety of air navigation. 2003. 432 p.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Dynamic cost indexing – Managing airline delay cost /A. Cook, G. Tanner, V. Williams., G. Meise// Journal of Air Transport Management. 2009. 15(1). pp. 26-35.DOI 10.1016/j.jairtraman.2008.07.001.</mixed-citation><mixed-citation xml:lang="en">ICAO. Air traffic services planning manual, 1st ed. International Civil Aviation Organization. 1984.</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Dynamic traffic network model and time-dependent Braess’ paradox / J. Zhao, Z. Gao, B. Jia, X. Guo, H. Sun // Discrete Dynamics in Nature and Society. 2014. pp. 1-10. Article ID 802129. DOI 10.1155/2014/802129.</mixed-citation><mixed-citation xml:lang="en">Mahmoud N. A., Al-Hindawi B. H., Hasan M. Y. (2021). A Modified Dynamic Programming Approach for 4D Minimum Fuel and Emissions Trajectory Optimization // Aerospace. 8(5). Article 135.</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Eurocontrol manual for airspace planning. Common guidelines. Second Edition / European organization for the safety of air navigation. 2003. 432 p.</mixed-citation><mixed-citation xml:lang="en">Manik D., Witthaut D., Timme M. (2022). Predicting Braess' Paradox in Supply and Transport Networks. ArXiv preprint. arXiv:2203.10062.</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">ICAO. Air traffic services planning manual. 1st ed. / International Civil Aviation Organization, 1984.</mixed-citation><mixed-citation xml:lang="en">Pechenezhsky V.K., Chuvikovskaya E.K.(2023).Features of airspace planning organization in the Russian Federationon the example of the Moscow airspace. Scientific Bulletin of MSTU CA. 26(6): 47–57.</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Mahmoud N. A. A Modified Dynamic Programming Approach for 4D Minimum Fuel and Emissions Trajectory Optimization / N. A. Mahmoud, B. H. Al-Hindawi, M. Y. Hasan// Aerospace. 2021.Vol.8, № 5. Article 135. DOI 10.3390/aerospace8050135.</mixed-citation><mixed-citation xml:lang="en">Rosenberger J.M., Johnson E.L., Nemhauser G.L. (2004). Rerouting aircraft for airline recovery. Transportation Science.38(2): 162-182.</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">Manik D.Predicting Braess' Paradox in Supply and Transport Networks /D. Manik, D. Witthaut, M. Timme// ArXiv preprint. 2022. arXiv:2203.10062. DOI 10.48550/arXiv.22053.14685.</mixed-citation><mixed-citation xml:lang="en">Tcheukam S. A., Tembine H. (2016). Mean-field-type games on airline networks and airport queues: Braess paradox, its negation, and crowd effect. Dynamic Games and Applications.11(1): 83-109.</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">Modifying link capacity to avoid Braess Paradox considering elastic demand / A. Wang, Y. Tang, Y. Mohmand, P. Xu // Physica A: Statistical Mechanics and its Applications. 2022. p. 605. 128002. DOI https://doi.org/10.1016/j.physa.2022.127951.</mixed-citation><mixed-citation xml:lang="en">Veremey E.I., Sotnikova M.V .(2016).Optimal routing based on weather forecast. International Journal of Open Information Technologies. 4(3): 45-53.</mixed-citation></citation-alternatives></ref><ref id="cit15"><label>15</label><citation-alternatives><mixed-citation xml:lang="ru">Rosenberger J.M.Rerouting aircraft for airline recovery / J. M. Rosenberger, E. L. Johnson, G. L. Nemhauser//Transportation Science. 2004.№ 38(2).pp. 162-182. DOI 10.1287/trsc.37.4.408.23271.</mixed-citation><mixed-citation xml:lang="en">Vickrey W.S. (1969). Congestion theory and transport investment. The American Economic Review.59(2): 251-260.</mixed-citation></citation-alternatives></ref><ref id="cit16"><label>16</label><citation-alternatives><mixed-citation xml:lang="ru">Tcheukam S. A.Mean-field-type games on airline networks and airport queues: Braess paradox, its negation, and crowd effect /A. S. Tcheukam, H. Tembine // Dynamic Games and Applications. 2016.11(1). pp. 83-109.DOI10.1109/SSD.2016.7473658.</mixed-citation><mixed-citation xml:lang="en">Wang A., Tang Y., Mohmand Y.T., Xu P. (2022). Modifying link capacity to avoid Braess Paradox considering elastic demand. Physica A: Statistical Mechanics and its Applications.605: 128002.</mixed-citation></citation-alternatives></ref><ref id="cit17"><label>17</label><citation-alternatives><mixed-citation xml:lang="ru">Vickrey W.S. Congestion theory and transport investment //The American Economic Review. 1969.59(2). p. 251-260.</mixed-citation><mixed-citation xml:lang="en">Zhao J., Gao Z., Jia B., Guo X., Sun H. (2014). Dynamic traffic network model and time-dependent Braess’ paradox. Discrete Dynamics in Nature and Society. 1-10: Article ID 802129.</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>
