<?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">caht</journal-id><journal-title-group><journal-title xml:lang="ru">Научный вестник МГТУ ГА</journal-title><trans-title-group xml:lang="en"><trans-title>Civil Aviation High Technologies</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">2079-0619</issn><issn pub-type="epub">2542-0119</issn><publisher><publisher-name>Moscow State Technical University of Civil Aviation (MSTU CA)</publisher-name></publisher></journal-meta><article-meta><article-id custom-type="elpub" pub-id-type="custom">caht-315</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>An evolutionary method for finding the optimal path connecting two settlements</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>Dement'ev</surname><given-names>Yu. I.</given-names></name></name-alternatives><email xlink:type="simple">noemail@neicon.ru</email><xref ref-type="aff" rid="aff-1"/></contrib><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>Zimin</surname><given-names>R. V.</given-names></name></name-alternatives><email xlink:type="simple">noemail@neicon.ru</email></contrib></contrib-group><aff xml:lang="ru" id="aff-1"><institution>МГТУ ГА</institution><country>Russian Federation</country></aff><pub-date pub-type="collection"><year>2015</year></pub-date><pub-date pub-type="epub"><day>07</day><month>11</month><year>2016</year></pub-date><issue>220</issue><fpage>130</fpage><lpage>136</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Дементьев Ю.И., Зимин Р.В., 2016</copyright-statement><copyright-year>2016</copyright-year><copyright-holder xml:lang="ru">Дементьев Ю.И., Зимин Р.В.</copyright-holder><copyright-holder xml:lang="en">Dement'ev Y.I., Zimin R.V.</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://avia.mstuca.ru/jour/article/view/315">https://avia.mstuca.ru/jour/article/view/315</self-uri><abstract><p>В статье рассматривается задача о поиске оптимального маршрута при соединении дорогой двух населённых пунктов. Отличительной особенностью работы является применение эволюционного метода для решения поставленной задачи.</p></abstract><trans-abstract xml:lang="en"><p>The paper describes an evolutionary method and an algorithm for finding the optimal path connecting two settlements.</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>evolutionary modeling</kwd><kwd>evolutionary algorithms</kwd><kwd>evolutionary method</kwd><kwd>converging algorithms</kwd><kwd>optimum way</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">Потапов А.С. Технологии искусственного интеллекта // СПб, ИТМО, 2010.</mixed-citation><mixed-citation xml:lang="en">Potapov A.S. Tekhnologii iskusstvennogo intellekta (Technology of an Artificial Intelligence), Sanct-Petersburg, ITMO, 2010, 218 p.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Емельянов В.В., Курейчик В.В., Курейчик В.М. Теория и практика эволюционного моделирования. - М.: Физматлит, 2003.</mixed-citation><mixed-citation xml:lang="en">Yevel'yanov V.V., Kureychik V.V., Kureychik V.M. Teoriya i praktika evolyutsionnogo modelirovaniya (Theory and Practice of Evolutionary Modelling), Moscow, Fizmatlit, 2003, 432 p.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Гладков Л.А., Курейчик В.В., Курейчик В.М. Генетические алгоритмы: учеб. пособие. - 2-е изд. - М.: Физматлит, 2006.</mixed-citation><mixed-citation xml:lang="en">Gladkov L.A., Kureychik V.V., Kureychik V.M. Geneticheskiye algoritmy: Uchebnoe posobiye. - 2-e izd. (Genetic Algorithms. Educational textbook, second edition) – Moscow, Fizmatlit, 2006, 320 p.</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>
