<?xml version="1.0" encoding="UTF-8"?>
<article article-type="research-article" dtd-version="1.3" xml:lang="ru" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:noNamespaceSchemaLocation="https://metafora.rcsi.science/xsd_files/journal3.xsd">
  <front>
    <journal-meta>
      <journal-id journal-id-type="publisher-id">moitvivt</journal-id>
      <journal-title-group>
        <journal-title xml:lang="ru">Моделирование, оптимизация и информационные технологии</journal-title>
        <trans-title-group xml:lang="en">
          <trans-title>Modeling, Optimization and Information Technology</trans-title>
        </trans-title-group>
      </journal-title-group>
      <issn pub-type="epub">2310-6018</issn>
      <publisher>
        <publisher-name>Издательство</publisher-name>
      </publisher>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.26102/2310-6018/2026.60.9.009</article-id>
      <article-id pub-id-type="custom" custom-type="elpub">2520</article-id>
      <title-group>
        <article-title xml:lang="ru">Параметрический синтез плана распределения частотных диапазонов эвристическими поисковыми алгоритмами</article-title>
        <trans-title-group xml:lang="en">
          <trans-title>Parametric synthesis of the frequency ranges distribution plan using heuristic search algorithms</trans-title>
        </trans-title-group>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author" corresp="yes">
          <contrib-id contrib-id-type="orcid">0000-0002-1695-5798</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>Stanovov</surname>
              <given-names>Vladimir Vadimovich</given-names>
            </name>
          </name-alternatives>
          <email>vladimirstanovov@yandex.ru</email>
          <xref ref-type="aff">aff-1</xref>
        </contrib>
        <contrib contrib-type="author">
          <contrib-id contrib-id-type="orcid">0009-0009-3827-3032</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>Tausnev</surname>
              <given-names>Daniil Alekseevich</given-names>
            </name>
          </name-alternatives>
          <email>mr.tays@bk.ru</email>
          <xref ref-type="aff">aff-2</xref>
        </contrib>
        <contrib contrib-type="author">
          <contrib-id contrib-id-type="orcid">0009-0003-2307-8759</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>Gorbunov</surname>
              <given-names>Sergei Mikhailovich</given-names>
            </name>
          </name-alternatives>
          <email>jee1ary@yandex.ru</email>
          <xref ref-type="aff">aff-3</xref>
        </contrib>
        <contrib contrib-type="author">
          <contrib-id contrib-id-type="orcid">0009-0000-3072-6951</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>Morozov</surname>
              <given-names>Eduard Vyacheslavovich</given-names>
            </name>
          </name-alternatives>
          <email>morozoveduardmsd@gmail.com</email>
          <xref ref-type="aff">aff-4</xref>
        </contrib>
        <contrib contrib-type="author">
          <contrib-id contrib-id-type="orcid">0000-0003-4146-5763</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>Gaipov</surname>
              <given-names>Konstantin Eduardovich</given-names>
            </name>
          </name-alternatives>
          <email>gaipovke@yandex.ru</email>
          <xref ref-type="aff">aff-5</xref>
        </contrib>
      </contrib-group>
      <aff-alternatives id="aff-1">
        <aff xml:lang="ru">Сибирский государственный университет науки и технологий имени академика М.Ф. Решетнева</aff>
        <aff xml:lang="en">Reshetnev Siberian State University of Science and Technology</aff>
      </aff-alternatives>
      <aff-alternatives id="aff-2">
        <aff xml:lang="ru">Сибирский государственный университет науки и технологий имени академика М.Ф. Решетнева</aff>
        <aff xml:lang="en">Reshetnev Siberian State University of Science and Technology</aff>
      </aff-alternatives>
      <aff-alternatives id="aff-3">
        <aff xml:lang="ru">Сибирский федеральный университет</aff>
        <aff xml:lang="en">Siberian Federal University</aff>
      </aff-alternatives>
      <aff-alternatives id="aff-4">
        <aff xml:lang="ru">Сибирский государственный университет науки и технологий имени академика М.Ф. Решетнева</aff>
        <aff xml:lang="en">Reshetnev Siberian State University of Science and Technology</aff>
      </aff-alternatives>
      <aff-alternatives id="aff-5">
        <aff xml:lang="ru">Сибирский государственный университет науки и технологий имени академика М.Ф. Решетнева</aff>
        <aff xml:lang="en">Reshetnev Siberian State University of Science and Technology</aff>
      </aff-alternatives>
      <pub-date pub-type="epub">
        <day>01</day>
        <month>01</month>
        <year>2026</year>
      </pub-date>
      <volume>1</volume>
      <issue>1</issue>
      <elocation-id>10.26102/2310-6018/2026.60.9.009</elocation-id>
      <permissions>
        <copyright-statement>Copyright © Авторы, 2026</copyright-statement>
        <copyright-year>2026</copyright-year>
        <license license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/">
          <license-p>This work is licensed under a Creative Commons Attribution 4.0 International License</license-p>
        </license>
      </permissions>
      <self-uri xlink:href="https://moitvivt.ru/ru/journal/article?id=2520"/>
      <abstract xml:lang="ru">
        <p>Развитие спутниковых телекоммуникационных систем приводит к необходимости решения задач распределения частотных диапазонов для используемых каналов связи, с учетом требований по пропускной способности сети. При этом необходимо учитывать неравномерность распределения трафика, а также зависимость пропускной способности от используемых частотных диапазонов. Требования к качеству обслуживания создают необходимость динамической настройки параметров сети, причем не только перераспределения потоков в ней, но и перераспределения доступных частотных диапазонов, а также переопределения их количества. Цель данного исследования – разработать алгоритмы синтеза плана распределения частотных диапазонов с учетом целевых запросов и структуры телекоммуникационной сети. Для этого реализован алгоритм определения минимального количества различных каналов связи путем раскраски графа, при этом определение потоков на ребрах графа определяется при помощи жадного градиентного алгоритма, оптимизирующего время задержки и коэффициент пропускной способности. Кроме этого, реализован генетический алгоритм для тонкой подстройки полученного изначального плана распределения частот. Проведенные вычислительные эксперименты показали способность разработанного алгоритма находить решения для сетей размерностью до 1000 узлов за приемлемое время. Для сетей небольшой размерности показано, что генетический алгоритм способен улучшать найденные решения с точки зрения пропускной способности сети.</p>
      </abstract>
      <trans-abstract xml:lang="en">
        <p>The development of the telecommunication systems leads to the need of solving frequencies ranges distribution problems for the used communication channels, considering the network throughput. The non-even distribution of the traffic, as well as the dependence of the throughput on the used frequency ranges should be considered. The requirements to the quality of service require dynamic tuning of the network parameters, and not only the redistribution of data flows in it, but also the redistribution of available frequency ranges, as well as their number. The aim of this study is to develop the algorithms of frequency ranges distribution synthesis, considering the target requests and the structure of the telecommunication network. For this an algorithm for determining the minimum number of different communication channels is implemented, which works by coloring the graph, and the flows on the edges of the graph are determined using greedy gradient algorithm, which optimizes the delay time and throughput coefficient. Moreover, the genetic algorithm for fine-tuning the initially designed frequency distribution plan is implemented. The performed computational experiments have shown the ability of the developed algorithm to find solutions for networks with up to 1000 nodes at a reasonable time. For networks of small dimension it is shown, that the genetic algorithm is able to improve the found solutions in terms of network throughput.</p>
      </trans-abstract>
      <kwd-group xml:lang="ru">
        <kwd>гетерогенные сети связи</kwd>
        <kwd>распределение информационных потоков</kwd>
        <kwd>динамическая маршрутизация</kwd>
        <kwd>жадные алгоритмы</kwd>
        <kwd>генетические алгоритмы</kwd>
      </kwd-group>
      <kwd-group xml:lang="en">
        <kwd>heterogeneous communication networks</kwd>
        <kwd>distribution of information flows</kwd>
        <kwd>dynamic routing</kwd>
        <kwd>greedy algorithms</kwd>
        <kwd>genetic algorithms</kwd>
      </kwd-group>
      <funding-group>
        <funding-statement xml:lang="ru">Исследование выполнено при финансовой поддержке Фонда НТИ в рамках Договора №70-2025-000804 от 26.05.2025.</funding-statement>
        <funding-statement xml:lang="en">The research has been performed with the financial support of the NTI Fund under contract №70-2025-000804 from 26.05.2025.</funding-statement>
      </funding-group>
    </article-meta>
  </front>
  <back>
    <ref-list>
      <title>References</title>
      <ref id="cit1">
        <label>1</label>
        <mixed-citation xml:lang="ru">Yan D., Guo J., Wang L., Zhan P. SADR: Network status adaptive QoS dynamic routing for satellite networks. In: 2016 IEEE 13th International Conference on Signal Processing, 06–10 November 2016, Chengdu, China. IEEE; 2016. P. 1186–1190. https://doi.org/10.1109/ICSP.2016.7878015</mixed-citation>
      </ref>
      <ref id="cit2">
        <label>2</label>
        <mixed-citation xml:lang="ru">Kasan H., Kim J. The case for dynamic bias in global adaptive routing. IEEE Computer Architecture Letters. 2021;20(1):38–41. https://doi.org/10.1109/LCA.2021.3061408</mixed-citation>
      </ref>
      <ref id="cit3">
        <label>3</label>
        <mixed-citation xml:lang="ru">Bertsekas D.P., Gallager R.G. Data Networks. London: Prentice-Hall; 1992. 556 p.</mixed-citation>
      </ref>
      <ref id="cit4">
        <label>4</label>
        <mixed-citation xml:lang="ru">Yen J.Y. Finding the k shortest loopless paths in a network. Management Science. 1971;17(11):712–716. https://doi.org/10.1287/mnsc.17.11.712</mixed-citation>
      </ref>
      <ref id="cit5">
        <label>5</label>
        <mixed-citation xml:lang="ru">Arbelaez A., Mehta D., O’Sullivan B., Quesada L. A Constraint-Based Local Search for Edge Disjoint Rooted Distance-Constrained Minimum Spanning Tree Problem. In: Integration of AI and OR Techniques in Constraint Programming, 18–22 May 2015, Barcelona, Spain. Cham: Springer; 2015. P. 31–46. https://doi.org/10.1007/978-3-319-18008-3_3</mixed-citation>
      </ref>
      <ref id="cit6">
        <label>6</label>
        <mixed-citation xml:lang="ru">Kuipers F., Van Mieghem P., Korkmaz T., Krunz M. An overview of constraint-based path selection algorithms for QoS routing. IEEE Communications Magazine. 2002;40(12):50–55. https://doi.org/10.1109/MCOM.2002.1106159</mixed-citation>
      </ref>
      <ref id="cit7">
        <label>7</label>
        <mixed-citation xml:lang="ru">Taft-Plotkin N., Bellur B., Ogier R. Quality-of-service routing using maximally disjoint paths. In: 1999 Seventh International Workshop on Quality of Service, 31 May – 04 June 1999, London, UK. IEEE; 1999. P. 119–128. https://doi.org/10.1109/iwqos.1999.766485</mixed-citation>
      </ref>
      <ref id="cit8">
        <label>8</label>
        <mixed-citation xml:lang="ru">Huang G.M., Zhu Sh. A fast distributed optimal routing algorithm for multicommodity large data networks. In: Proceedings of 9th International Parallel Processing Symposium, 25–28 April 1995, Santa Barbara, CA, USA. IEEE; 1995. P. 551–555. https://doi.org/10.1109/IPPS.1995.395985</mixed-citation>
      </ref>
      <ref id="cit9">
        <label>9</label>
        <mixed-citation xml:lang="ru">Jain A., Chaudhari N.S. Genetic algorithm for optimizing network load balance in MPLS network. In: 2012 Fourth International Conference on Computational Intelligence and Communication Networks, 03–05 November 2012, Mathura, India. IEEE; 2012. P. 122–126. https://doi.org/10.1109/cicn.2012.119</mixed-citation>
      </ref>
      <ref id="cit10">
        <label>10</label>
        <mixed-citation xml:lang="ru">Zhu Sh., Huang G.M. A new packet-loss minimization routing algorithm for ATM high-speed data networks. In: Proceedings of 35th IEEE Conference on Decision and Control, 13 December 1996, Kobe, Japan. IEEE; 2012. P. 287–292. https://doi.org/10.1109/CDC.1996.574317</mixed-citation>
      </ref>
      <ref id="cit11">
        <label>11</label>
        <mixed-citation xml:lang="ru">Gaipov K., Tausnev D., Khodenkov S., et al. Heuristic Greedy-Gradient Route Search Method for Finding an Optimal Traffic Distribution in Telecommunication Networks. Algorithms. 2024;17(1):7. https://doi.org/10.3390/a17010007</mixed-citation>
      </ref>
      <ref id="cit12">
        <label>12</label>
        <mixed-citation xml:lang="ru">Karakostas G. Faster approximation schemes for fractional multicommodity flow problems. ACM Transactions on Algorithms. 2008;4(1):13. https://doi.org/10.1145/1328911.1328924</mixed-citation>
      </ref>
      <ref id="cit13">
        <label>13</label>
        <mixed-citation xml:lang="ru">Stanovov V., Akhmedova Sh., Semenkin E. Genetic Algorithm with Success History based Parameter Adaptation. In: Proceedings of the 11th International Joint Conference on Computational Intelligence, 17–19 September 2019, Vienna, Austria. SciTePress; 2019. P. 180–187. https://doi.org/10.5220/0008071201800187</mixed-citation>
      </ref>
      <ref id="cit14">
        <label>14</label>
        <mixed-citation xml:lang="ru">Diestel R. Graph Theory. Berlin, Heidelberg: Springer; 2025. 455 p.</mixed-citation>
      </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>