<?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">sibsutis</journal-id><journal-title-group><journal-title xml:lang="ru">Вестник СибГУТИ</journal-title><trans-title-group xml:lang="en"><trans-title>The Herald of the Siberian State University of Telecommunications and Information Science</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">1998-6920</issn><publisher><publisher-name>СибГУТИ</publisher-name></publisher></journal-meta><article-meta><article-id custom-type="elpub" pub-id-type="custom">sibsutis-249</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>Structural-parametric adaptation of genetic 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>Minaeva</surname><given-names>Y. ..</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>2017</year></pub-date><pub-date pub-type="epub"><day>24</day><month>10</month><year>2022</year></pub-date><volume>0</volume><issue>1</issue><fpage>83</fpage><lpage>89</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Минаева Ю.В., 2022</copyright-statement><copyright-year>2022</copyright-year><copyright-holder xml:lang="ru">Минаева Ю.В.</copyright-holder><copyright-holder xml:lang="en">Minaeva Y...</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://vestnik.sibsutis.ru/jour/article/view/249">https://vestnik.sibsutis.ru/jour/article/view/249</self-uri><abstract><p>В статье рассматривается методика комплексной адаптации генетического алгоритма, позволяющая автоматизировать выбор варианта генетического оператора из заданного множества и произвести настройку его фактических параметров. Подобный подход позволит увеличить универсальность вычислительного алгоритма и уменьшить время эволюции за счет использования тех методов, которые уже показали свою эффективность при решении данной задачи. Для реализации процедуры параметрической настройки операторов предлагается использовать динамически формируемый набор правил, связывающих значения параметров операторов со статистическими характеристиками их операндов.</p></abstract><trans-abstract xml:lang="en"><p>The article considers the methodology of genetic algorithm complex adaptation which allows us to automate choice of genetic operator from given set and to adapt its actual parameters. Such approach allows us to increase computational algorithm universality and to decrease evolution time because of using the methods which have already shown their efficiency in similar task solution. Dynamic set of rules connecting operator parameter values with their operand statistical characteristic is proposed for parametric adaptation procedure realization.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>оптимизация</kwd><kwd>генетический алгоритм</kwd><kwd>генетические операторы</kwd><kwd>динамическая адаптация</kwd></kwd-group><kwd-group xml:lang="en"><kwd>optimization</kwd><kwd>genetic algorithm</kwd><kwd>genetic operators</kwd><kwd>dynamic adaptation</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">Емельянов В. В., Курейчик В. В., Курейчик В. М. Теория и практика эволюционного моделирования. М.: Физматлит. 2003. 432 с.</mixed-citation><mixed-citation xml:lang="en">Емельянов В. В., Курейчик В. В., Курейчик В. М. Теория и практика эволюционного моделирования. М.: Физматлит. 2003. 432 с.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Nunez-Letamendia L. Fitting the control parameters of a genetic algorithm: An application to technical trading systems design // European Journal of Operational Research. 2007. Vol. 179, № 3. P. 847-868.</mixed-citation><mixed-citation xml:lang="en">Nunez-Letamendia L. Fitting the control parameters of a genetic algorithm: An application to technical trading systems design // European Journal of Operational Research. 2007. Vol. 179, № 3. P. 847-868.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Harik G. R., Lobo F. G. A parameter-less genetic algorithm // Proceedings of the Genetic and Evolutionary Computation Conference. 1999. P. 258-265.</mixed-citation><mixed-citation xml:lang="en">Harik G. R., Lobo F. G. A parameter-less genetic algorithm // Proceedings of the Genetic and Evolutionary Computation Conference. 1999. P. 258-265.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Eiben A. E., Schut M. C., De Wilde A. R. Boosting genetic algorithms with self-adaptive selection // Proceedings of the IEEE Congress on Evolutionary Computation. 2006. P. 1584-1589.</mixed-citation><mixed-citation xml:lang="en">Eiben A. E., Schut M. C., De Wilde A. R. Boosting genetic algorithms with self-adaptive selection // Proceedings of the IEEE Congress on Evolutionary Computation. 2006. P. 1584-1589.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Hinterding R., Michalewicz Z., Eiben A. E. Adaptation in Evolutionary Computation: a Survey // Proceedings of the Fourth IEEE Conference on Evolutionary Computation. 1997. P. 65-69.</mixed-citation><mixed-citation xml:lang="en">Hinterding R., Michalewicz Z., Eiben A. E. Adaptation in Evolutionary Computation: a Survey // Proceedings of the Fourth IEEE Conference on Evolutionary Computation. 1997. P. 65-69.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Meyer-Nieberg S., Beyer H.-G. Self-adaptation in evolutionary algorithms // Studies in Computational Intelligence. 2007. Vol. 54. P. 47-75.</mixed-citation><mixed-citation xml:lang="en">Meyer-Nieberg S., Beyer H.-G. Self-adaptation in evolutionary algorithms // Studies in Computational Intelligence. 2007. Vol. 54. P. 47-75.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Laoufi A., Hadjeri S., Hazzab A. Adaptive probabilities of crossover and mutation in genetic algorithms for power economic dispatch // International Journal of Applied Engineering Research. 2006. Vol. 1, № 3. P. 393-408.</mixed-citation><mixed-citation xml:lang="en">Laoufi A., Hadjeri S., Hazzab A. Adaptive probabilities of crossover and mutation in genetic algorithms for power economic dispatch // International Journal of Applied Engineering Research. 2006. Vol. 1, № 3. P. 393-408.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Lin W.-Y., Lee W.-Y., Hong T.-P. Adapting crossover and mutation rates in genetic algorithms // Journal of Information Science and Engineering. 2003. Vol. 19. P. 889-903.</mixed-citation><mixed-citation xml:lang="en">Lin W.-Y., Lee W.-Y., Hong T.-P. Adapting crossover and mutation rates in genetic algorithms // Journal of Information Science and Engineering. 2003. Vol. 19. P. 889-903.</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Yang S. Adaptive crossover in genetic algorithms using statistics mechanism // Proceedings of the 8th International conference on Artificial life. 2002. P. 182-185.</mixed-citation><mixed-citation xml:lang="en">Yang S. Adaptive crossover in genetic algorithms using statistics mechanism // Proceedings of the 8th International conference on Artificial life. 2002. P. 182-185.</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Tabarzad M. A., Lucas C., Hamzeh A. Statistical genetic algorithm // International Journal of Computer, Electrical, Automation, Control and Information Engineering. 2008. Vol. 2, № 2. P. 483-487.</mixed-citation><mixed-citation xml:lang="en">Tabarzad M. A., Lucas C., Hamzeh A. Statistical genetic algorithm // International Journal of Computer, Electrical, Automation, Control and Information Engineering. 2008. Vol. 2, № 2. P. 483-487.</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Whitley D. The GENITOR algorithm and selection pressure: Why rank-based allocation of reproductive trials is best // Proceedings of the Third International Conference on Genetic Algorithms. 1989. P. 116-121.</mixed-citation><mixed-citation xml:lang="en">Whitley D. The GENITOR algorithm and selection pressure: Why rank-based allocation of reproductive trials is best // Proceedings of the Third International Conference on Genetic Algorithms. 1989. P. 116-121.</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Goldberg D. E., Deb K. A comparative analysis of selection schemes used in genetic algorithms // Foundations of Genetic Algorithms. 1991. P. 69-93.</mixed-citation><mixed-citation xml:lang="en">Goldberg D. E., Deb K. A comparative analysis of selection schemes used in genetic algorithms // Foundations of Genetic Algorithms. 1991. P. 69-93.</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">Back T., Fogel D. B., Michalewicz Z. Evolutionary Computation! Basic Algorithms and Operators. IOP Publishing ltd. 2000. 339 p.</mixed-citation><mixed-citation xml:lang="en">Back T., Fogel D. B., Michalewicz Z. Evolutionary Computation! Basic Algorithms and Operators. IOP Publishing ltd. 2000. 339 p.</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">Цой Ю. Р., Спицын В. Г. Исследование генетического алгоритма с динамически изменяемым размером популяции // Труды Международной научно-технической конференции «Интеллектуальные системы (IEEE AIS'05)». Научное издание. М.: Изд-во физикоматематической литературы. 2005. С. 241-246.</mixed-citation><mixed-citation xml:lang="en">Цой Ю. Р., Спицын В. Г. Исследование генетического алгоритма с динамически изменяемым размером популяции // Труды Международной научно-технической конференции «Интеллектуальные системы (IEEE AIS'05)». Научное издание. М.: Изд-во физикоматематической литературы. 2005. С. 241-246.</mixed-citation></citation-alternatives></ref><ref id="cit15"><label>15</label><citation-alternatives><mixed-citation xml:lang="ru">Eiben A. E., Marchiori E., Valko V. A. Evolutionary algorithms with on-the-fly population size adjustment // Parallel Problem Solving from Nature VIII. 2004. Vol. 3242. P. 41-50.</mixed-citation><mixed-citation xml:lang="en">Eiben A. E., Marchiori E., Valko V. A. Evolutionary algorithms with on-the-fly population size adjustment // Parallel Problem Solving from Nature VIII. 2004. Vol. 3242. P. 41-50.</mixed-citation></citation-alternatives></ref><ref id="cit16"><label>16</label><citation-alternatives><mixed-citation xml:lang="ru">Arabas J., Michalewicz Z., Mulawka J. GAVAPS - a genetic algorithm with varying population size // Proc. of the First IEEE International Conference on Evolutionary Computation. 1994. P. 73-78.</mixed-citation><mixed-citation xml:lang="en">Arabas J., Michalewicz Z., Mulawka J. GAVAPS - a genetic algorithm with varying population size // Proc. of the First IEEE International Conference on Evolutionary Computation. 1994. P. 73-78.</mixed-citation></citation-alternatives></ref><ref id="cit17"><label>17</label><citation-alternatives><mixed-citation xml:lang="ru">Back T., Eiben A. E., Vaart N. A. L. An empirical study on GAs without parameters // Parallel Problem Solving from Nature VI. 2000. Vol. 1917. P. 315-324.</mixed-citation><mixed-citation xml:lang="en">Back T., Eiben A. E., Vaart N. A. L. An empirical study on GAs without parameters // Parallel Problem Solving from Nature VI. 2000. Vol. 1917. P. 315-324.</mixed-citation></citation-alternatives></ref><ref id="cit18"><label>18</label><citation-alternatives><mixed-citation xml:lang="ru">Goldberg D. E., Deb K., Clark J. H. Genetic algorithms, noise, and the sizing of populations // Complex Systems. 1992. № 6. P. 333-362.</mixed-citation><mixed-citation xml:lang="en">Goldberg D. E., Deb K., Clark J. H. Genetic algorithms, noise, and the sizing of populations // Complex Systems. 1992. № 6. P. 333-362.</mixed-citation></citation-alternatives></ref><ref id="cit19"><label>19</label><citation-alternatives><mixed-citation xml:lang="ru">Семенкина М. Е. Самоадаптивные эволюционные алгоритмы проектирования информационных технологий интеллектуального анализа данных // Искусственный интеллект и принятие решений. 2013. № 1. С. 13-23.</mixed-citation><mixed-citation xml:lang="en">Семенкина М. Е. Самоадаптивные эволюционные алгоритмы проектирования информационных технологий интеллектуального анализа данных // Искусственный интеллект и принятие решений. 2013. № 1. С. 13-23.</mixed-citation></citation-alternatives></ref><ref id="cit20"><label>20</label><citation-alternatives><mixed-citation xml:lang="ru">Hilding F. G., Ward K. Automated operator selection on genetic algorithms // Proceedings of the 9th international conference on Knowledge-Based Intelligent Information and Engineering Systems. 2005. № 4. P. 903-909.</mixed-citation><mixed-citation xml:lang="en">Hilding F. G., Ward K. Automated operator selection on genetic algorithms // Proceedings of the 9th international conference on Knowledge-Based Intelligent Information and Engineering Systems. 2005. № 4. P. 903-909.</mixed-citation></citation-alternatives></ref><ref id="cit21"><label>21</label><citation-alternatives><mixed-citation xml:lang="ru">Shamsaei R., Hamzeh A., Rahmani A. Adaptive genetic algorithms based on learning classifier systems // 9'th Computer Society of Iran Computer Conference. 2004.</mixed-citation><mixed-citation xml:lang="en">Shamsaei R., Hamzeh A., Rahmani A. Adaptive genetic algorithms based on learning classifier systems // 9'th Computer Society of Iran Computer Conference. 2004.</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>
