<?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">koz</journal-id><journal-title-group><journal-title xml:lang="ru">"Вестник Северо-Казахстанского университета имени Манаша Козыбаева"</journal-title><trans-title-group xml:lang="en"><trans-title>Bulletin of Manash Kozybayev North Kazakhstan University</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">2958-003X</issn><issn pub-type="epub">2958-0048</issn><publisher><publisher-name>М. Қозыбаев атындағы СҚУ</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.54596/2958-0048-2025-1-207-214</article-id><article-id custom-type="elpub" pub-id-type="custom">koz-1963</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><subj-group subj-group-type="section-heading" xml:lang="en"><subject>INFORMATION AND COMMUNICATION TECHNOLOGIES</subject></subj-group></article-categories><title-group><article-title>Анализ влияния параметров генетических алгоритмов на эффективность оптимизации в среде MATLAB</article-title><trans-title-group xml:lang="en"><trans-title>Analysis of the impact of genetic algorithm parameters on optimization efficiency in MATLAB</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0002-0074-2966</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>Astapenko</surname><given-names>N. V.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Доцент кафедры "Информационно-коммуникационные технологии", доктор phd</p><p>Петропавловск </p></bio><bio xml:lang="en"><p>Astapenko N.V. - corresponding author, Associate Professor of the Information and Communication Technologies, PhD</p><p>Petrolpavlovsk</p></bio><email xlink:type="simple">astankin@mail.ru</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">«Manash Kozybayev North Kazakhstan University» NPLC<country>Kazakhstan</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2025</year></pub-date><pub-date pub-type="epub"><day>30</day><month>03</month><year>2025</year></pub-date><volume>0</volume><issue>1 (65)</issue><fpage>207</fpage><lpage>214</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">Astapenko N.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://vestnik.ku.edu.kz/jour/article/view/1963">https://vestnik.ku.edu.kz/jour/article/view/1963</self-uri><abstract><p>В статье представлен анализ влияния параметров генетических алгоритмов (ГА) на эффективность оптимизации сложных нелинейных функций с использованием MATLAB Optimization Toolbox. В качестве объекта исследования выбрана функция Растригина, известная своей сложной структурой и множеством локальных минимумов. Рассматриваются ключевые параметры ГА, включая размер популяции, вероятность мутации и кроссовера, а также условия остановки. Проведенные эксперименты показали, что корректная настройка параметров алгоритма значительно повышает его способность к нахождению глобального минимума и снижает вероятность преждевременной сходимости. Полученные результаты подчеркивают важность адаптации параметров под конкретные задачи и демонстрируют потенциал применения ГА в инженерных и научных приложениях. В заключении обсуждаются ограничения метода и предлагаются направления для дальнейших исследований, включая разработку гибридных подходов.</p></abstract><trans-abstract xml:lang="en"><p>This paper presents an analysis of the impact of genetic algorithm (GA) parameters on the efficiency of optimizing complex nonlinear functions using the MATLAB Optimization Toolbox. The study focuses on the Rastrigin function, known for its complex structure and multiple local minima. Key GA parameters, including population size, mutation and crossover probabilities, and stopping conditions, are considered. Experimental results demonstrate that proper parameter tuning significantly enhances the algorithm's ability to find the global minimum while reducing the likelihood of premature convergence. The findings highlight the importance of adapting GA parameters to specific optimization tasks and demonstrate the potential of GA applications in engineering and scientific domains. Limitations of the method are discussed, and future research directions, including the development of hybrid approaches, are proposed.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>генетические алгоритмы</kwd><kwd>оптимизация</kwd><kwd>параметры алгоритма</kwd><kwd>MATLAB</kwd><kwd>функция Растригина</kwd></kwd-group><kwd-group xml:lang="en"><kwd>genetic algorithms</kwd><kwd>optimization</kwd><kwd>algorithm parameters</kwd><kwd>MATLAB</kwd><kwd>Rastrigin function</kwd><kwd>global minimum</kwd><kwd>nonlinear functions</kwd><kwd>hybrid optimization</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">Haupt R.L., Haupt S.E. Practical Genetic Algorithms. – Wiley, 2004. - p. 253.</mixed-citation><mixed-citation xml:lang="en">Haupt R.L., Haupt S.E. Practical Genetic Algorithms. – Wiley, 2004. - p. 253.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Simon D. Evolutionary Optimization Algorithms. – Wiley, 2017. - p. 776.</mixed-citation><mixed-citation xml:lang="en">Simon D. Evolutionary Optimization Algorithms. – Wiley, 2017. - p. 776.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Dai Q., Liu N. Alleviating the problem of local minima in Backpropagation through competitive learning. Neurocomputing. - 2012. - 94(1). - P. 152–158. DOI: 10.1016/j.neucom.2012.03.011</mixed-citation><mixed-citation xml:lang="en">Dai Q., Liu N. Alleviating the problem of local minima in Backpropagation through competitive learning. Neurocomputing. - 2012. - 94(1). - P. 152–158. DOI: 10.1016/j.neucom.2012.03.011</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Shad R., Doris L. Optimization techniques in machine learning: develop and analyze optimization algorithms for machine learning, such as stochastic gradient descent, convex optimization, and non-convex optimization. – Mathematics, 2024. - p. 19.</mixed-citation><mixed-citation xml:lang="en">Shad R., Doris L. Optimization techniques in machine learning: develop and analyze optimization algorithms for machine learning, such as stochastic gradient descent, convex optimization, and non-convex optimization. – Mathematics, 2024. - p. 19.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Kramer O. Genetic Algorithm Essentials. – Springer, 2017. - p. 94.</mixed-citation><mixed-citation xml:lang="en">Kramer O. Genetic Algorithm Essentials. – Springer, 2017. - p. 94.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Deb K. Optimization for Engineering Design: Algorithms and Examples. PHI Learning. - 2012. - p. 440.</mixed-citation><mixed-citation xml:lang="en">Deb K. Optimization for Engineering Design: Algorithms and Examples. PHI Learning. - 2012. - p. 440.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">MathWorks. MATLAB Optimization Toolbox Documentation. 2024. URL: https://www.mathworks.com/help/optim/index.html</mixed-citation><mixed-citation xml:lang="en">MathWorks. MATLAB Optimization Toolbox Documentation. 2024. URL: https://www.mathworks.com/help/optim/index.html</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>
