<?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-228</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>SOLUTION OF THE SATELLITE TRANSFER PROBLEM WITH HYBRID MEMETIC ALGORITHM</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>Panteleyev</surname><given-names>A. V.</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>Pismennaya</surname><given-names>V. A.</given-names></name></name-alternatives><email xlink:type="simple">noemail@neicon.ru</email><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff xml:lang="ru" id="aff-1"><institution>МАИ</institution><country>Russian Federation</country></aff><pub-date pub-type="collection"><year>2014</year></pub-date><pub-date pub-type="epub"><day>07</day><month>11</month><year>2016</year></pub-date><volume>0</volume><issue>207</issue><fpage>25</fpage><lpage>32</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">Panteleyev A.V., Pismennaya V.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://avia.mstuca.ru/jour/article/view/228">https://avia.mstuca.ru/jour/article/view/228</self-uri><abstract><p>В работе предложен гибридный меметический алгоритм (МА) для решения задачи поиска оптимального программного управления нелинейными непрерывными детерминированными системами, основанный на концепции мема, которым является одно из перспективных решений, полученных в ходе реализации процедуры поиска экстремума. На основе предложенного алгоритма сформирован комплекс программ на языке C#. Приведено решение задачи о переводе спутника с одной орбиты на другую.</p></abstract><trans-abstract xml:lang="en"><p>This paper presents a hybrid memetic algorithm (MA) to solve the problem of finding the optimal program control of nonlinear continuous deterministic systems based on the concept of the meme, which is one of the promising solutions obtained in the course of implementing the procedure for searching the extremes. On the basis of the proposed algorithm the software complex is formed in C#. The solution of satellite transfer problem is presented.</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>optimal control</kwd><kwd>global extremes</kwd><kwd>nonlinear continuous deterministic systems</kwd><kwd>memetic algorithm</kwd><kwd>satellite transfer problem</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">Dawkins R. Universal Darwinism in D.S. Bendall (ed.), Evolution: From Molecules to Men, Cambridge University Press, Cambridge, 1983. - P. 403-425.</mixed-citation><mixed-citation xml:lang="en">Dawkins R. Universal Darwinism in D.S. Bendall (ed.), Evolution: From Molecules to Men, Cambridge University Press, Cambridge, 1983. - P. 403-425.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Dawkins R. The Selfish Gene. - Oxford University Press, 1976.</mixed-citation><mixed-citation xml:lang="en">Dawkins R. The Selfish Gene. - Oxford University Press, 1976.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Moscato P. On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts: Towards Memetic Algorithms // Caltech Concurrent Computation Program (report 826), 1989.</mixed-citation><mixed-citation xml:lang="en">Moscato P. On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts: Towards Memetic Algorithms // Caltech Concurrent Computation Program (report 826), 1989.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Neri F., Cotta C., Moscato P. Handbook of Memetic Algorithms // Studies in Computational Intelligence, V. 379, Springer-Verlag, Berlin Heidelberg, 2012.</mixed-citation><mixed-citation xml:lang="en">Neri F., Cotta C., Moscato P. Handbook of Memetic Algorithms // Studies in Computational Intelligence, V. 379, Springer-Verlag, Berlin Heidelberg, 2012.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Dorigo M., Socha K. Ant colony optimization for continuous domains // European Journal of Operational Research. V. 185, 2008. - P. 1155-1173.</mixed-citation><mixed-citation xml:lang="en">Dorigo M., Socha K. Ant colony optimization for continuous domains // European Journal of Operational Research. V. 185, 2008. - P. 1155-1173.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Kirkpatrick S., Gelatt C.D., Vecchi M.P. Optimization by simulated annealing. Science. V. 220, 1983. - P. 671-680.</mixed-citation><mixed-citation xml:lang="en">Kirkpatrick S., Gelatt C.D., Vecchi M.P. Optimization by simulated annealing. Science. V. 220, 1983. - P. 671-680.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Киреев В.И., Пантелеев А.В. Численные методы в примерах и задачах. - М.: Высшая школа, 2008.</mixed-citation><mixed-citation xml:lang="en">Киреев В.И., Пантелеев А.В. Численные методы в примерах и задачах. - М.: Высшая школа, 2008.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Duarte A., Marti R., Gortazar F. Path relinking for large scale global optimization. Soft Comput. 15(11), 2001. - P. 2257-2273.</mixed-citation><mixed-citation xml:lang="en">Duarte A., Marti R., Gortazar F. Path relinking for large scale global optimization. Soft Comput. 15(11), 2001. - P. 2257-2273.</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Охорзин В.А., Рыжиков И.С. Решение терминальной задачи управления в виде многоуровневого реле // Перспективные инновации в науке, образовании, производстве и транспорте 2012: материалы междунар. науч.-практич. конф. - Вып. 2. - 2012. - Т. 2. - С. 89-93.</mixed-citation><mixed-citation xml:lang="en">Охорзин В.А., Рыжиков И.С. Решение терминальной задачи управления в виде многоуровневого реле // Перспективные инновации в науке, образовании, производстве и транспорте 2012: материалы междунар. науч.-практич. конф. - Вып. 2. - 2012. - Т. 2. - С. 89-93.</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Пантелеев А.В., Метлицкая Д.В., Алешина Е.А. Методы глобальной оптимизации. Метаэвристические стратегии и алгоритмы. - М.: Вузовская книга, 2013.</mixed-citation><mixed-citation xml:lang="en">Пантелеев А.В., Метлицкая Д.В., Алешина Е.А. Методы глобальной оптимизации. Метаэвристические стратегии и алгоритмы. - М.: Вузовская книга, 2013.</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>
