<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE root>
<article 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" xmlns:ali="http://www.niso.org/schemas/ali/1.0/" article-type="research-article" dtd-version="1.2" xml:lang="en"><front><journal-meta><journal-id journal-id-type="publisher-id">ARTIFICIAL INTELLIGENCE AND DECISION MAKING</journal-id><journal-title-group><journal-title xml:lang="en">ARTIFICIAL INTELLIGENCE AND DECISION MAKING</journal-title><trans-title-group xml:lang="ru"><trans-title>Искусственный интеллект и принятие решений</trans-title></trans-title-group></journal-title-group><issn publication-format="print">2071-8594</issn></journal-meta><article-meta><article-id pub-id-type="publisher-id">265430</article-id><article-id pub-id-type="doi">10.14357/20718594240207</article-id><article-id pub-id-type="edn">VQYBOD</article-id><article-categories><subj-group subj-group-type="toc-heading" xml:lang="en"><subject>System, Evolutionary, Cognitive Modeling</subject></subj-group><subj-group subj-group-type="toc-heading" xml:lang="ru"><subject>Системное, эволюционное, когнитивное моделирование</subject></subj-group><subj-group subj-group-type="article-type"><subject>Research Article</subject></subj-group></article-categories><title-group><article-title xml:lang="en">Hybrid algorithm for mixed multi-objective optimization «cuckoo search» with genetic crossover operator</article-title><trans-title-group xml:lang="ru"><trans-title>Гибридный алгоритм смешанной многокритериальной оптимизации «кукушкин поиск» с генетическим оператором скрещивания</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author"><name-alternatives><name xml:lang="en"><surname>Sarin</surname><given-names>Konstantin S.</given-names></name><name xml:lang="ru"><surname>Сарин</surname><given-names>Константин Сергеевич</given-names></name></name-alternatives><address><country country="RU">Russian Federation</country></address><bio xml:lang="en"><p>Candidate of technical sciences, docent, Assistant Professor, Senior Researcher</p></bio><bio xml:lang="ru"><p>кандидат технических наук, доцент, старший научный сотрудник</p></bio><email>sarin.konstantin@mail.ru</email><xref ref-type="aff" rid="aff1"/></contrib></contrib-group><aff-alternatives id="aff1"><aff><institution xml:lang="en">Tomsk State University of Control Systems and Radioelectronics</institution></aff><aff><institution xml:lang="ru">Томский государственный университет систем управления и радиоэлектроники</institution></aff></aff-alternatives><pub-date date-type="pub" iso-8601-date="2024-08-05" publication-format="electronic"><day>05</day><month>08</month><year>2024</year></pub-date><issue>2</issue><issue-title xml:lang="en"/><issue-title xml:lang="ru"/><fpage>87</fpage><lpage>105</lpage><history><date date-type="received" iso-8601-date="2024-10-03"><day>03</day><month>10</month><year>2024</year></date><date date-type="accepted" iso-8601-date="2024-10-03"><day>03</day><month>10</month><year>2024</year></date></history><permissions><copyright-statement xml:lang="en">Copyright ©; 2024, ФИЦ ИУ РАН</copyright-statement><copyright-statement xml:lang="ru">Copyright ©; 2024,</copyright-statement><copyright-year>2024</copyright-year><copyright-holder xml:lang="en">ФИЦ ИУ РАН</copyright-holder></permissions><self-uri xlink:href="https://journals.rcsi.science/2071-8594/article/view/265430">https://journals.rcsi.science/2071-8594/article/view/265430</self-uri><abstract xml:lang="en"><p>The article proposes a mixed-integer multi-objective optimization algorithm based on the cuckoo search metaheuristic and the genetic crossover operator. Search in discrete space is carried out using a genetic operator, and in continuous space using a metaheuristic strategy. Performance was as- sessed using modified ZDT and DTLZ tests with mixed variables. The experimental results showed the high efficiency of the proposed algorithm on complex estimates of convergence and diversity.</p></abstract><trans-abstract xml:lang="ru"><p>В статье предлагается многокритериальный алгоритм смешанной оптимизации, основанный на метаэвристике «кукушкин поиск» и генетическом операторе скрещивания. Поиск в дискретном пространстве осуществляется с помощью генетического оператора, а в непрерывном пространстве - с помощью стратегии метаэвристики. Работоспособность оценивалась на модифицированных тестах ZDT и DTLZ со смешанными переменными. Результаты эксперимента показали высокую эффективность предлагаемого алгоритма на комплексных оценках сходимости и многообразия.</p></trans-abstract><kwd-group xml:lang="en"><kwd>optimization methods</kwd><kwd>multi-objective optimization</kwd><kwd>metaheuristics</kwd><kwd>stochastic algorithms</kwd><kwd>evolutionary intelligence</kwd><kwd>swarm intelligence</kwd><kwd>mixed optimization</kwd><kwd>genetic algorithm</kwd><kwd>cuckoo search</kwd><kwd>hybrid algorithm</kwd></kwd-group><kwd-group xml:lang="ru"><kwd>методы оптимизации</kwd><kwd>многокритериальная оптимизация</kwd><kwd>метаэвристики</kwd><kwd>стохастические алгоритмы</kwd><kwd>эволюционный интеллект</kwd><kwd>роевой интеллект</kwd><kwd>смешанная оптимизация</kwd><kwd>генетический алгоритм</kwd><kwd>кукушкин поиск</kwd><kwd>гибридный алгоритм</kwd></kwd-group><funding-group><funding-statement xml:lang="en">The study was supported by the Russian Science Foundation grant No. 24-21-00168, https://rscf.ru/project/24-21-00168.</funding-statement><funding-statement xml:lang="ru">Исследование выполнено за счет гранта Российского научного фонда № 24-21-00168, https://rscf.ru/project/24-21-00168.</funding-statement></funding-group></article-meta></front><body></body><back><ref-list><ref id="B1"><label>1.</label><mixed-citation>Shrestha A.K., Mahmood A. Review of deep learning algorithms and architectures // IEEE Access. 2019. V. 7. P. 53040-53065.</mixed-citation></ref><ref id="B2"><label>2.</label><mixed-citation>Alzubaidi L., Zhang J., Humaidi A.J., Al-Dujaili A. et al. Review of deep learning: concepts, CNN architectures, challenges, applications, future directions // Journal of Big Data. 2021. V. 8. No 53. P. 1-74.</mixed-citation></ref><ref id="B3"><label>3.</label><citation-alternatives><mixed-citation xml:lang="en">Sarin K.S. Nechetkiy klassifikator tipa Min-Max: obzor [Fuzzy Min-Max Сlassifier: Review] // Doklady TUSUR [Proceedings of TUSUR]. 2023. V. 26. No 1. С. 65-75.</mixed-citation><mixed-citation xml:lang="ru">Сарин К.С. Нечеткий классификатор типа Min-Max: обзор // Доклады ТУСУР. 2023. Т. 26. № 1. С. 65-75.</mixed-citation></citation-alternatives></ref><ref id="B4"><label>4.</label><citation-alternatives><mixed-citation xml:lang="en">Hodashinsky I.A., Sarin K.S. Metodika postroyeniya kompaktnykh i tochnykh nechetkikh sistem tipa Takagi- Sugeno [Technique for designing accurate and compact Takagi–Sugeno fuzzy systems] // Doklady TUSUR [Proceedings of TUSUR]. 2016. V. 19. No 1. С. 50-56.</mixed-citation><mixed-citation xml:lang="ru">Ходашинский И.А., Сарин К.С. Методика построения компактных и точных нечетких систем типа Такаги-Сугено // Доклады ТУСУР. 2016. Т. 19. № 1. С. 50-56.</mixed-citation></citation-alternatives></ref><ref id="B5"><label>5.</label><citation-alternatives><mixed-citation xml:lang="en">Bardamova M.B., Buymov A.G., Tarasenko V.F. Sposoby adaptatsii algoritma prygayushchikh lyagushek k binarnomu prostranstvu poiska pri reshenii zadachi otbora priznakov [Methods for adapting the leaping frog algorithm to the binary search space when solving the feature selection problem] // Doklady TUSUR [Proceedings of TUSUR]. 2020. V. 23. No 4. С. 57-62.</mixed-citation><mixed-citation xml:lang="ru">Бардамова М.Б., Буймов А.Г., Тарасенко В.Ф. Способы адаптации алгоритма прыгающих лягушек к бинарному пространству поиска при решении задачи отбора признаков // Доклады ТУСУР. 2020. Т. 23. № 4. С. 57-62.</mixed-citation></citation-alternatives></ref><ref id="B6"><label>6.</label><mixed-citation>Cerulli M., Pelegrin M., Cafieri S., D’Ambrosio C., Rey D. Aircraft Conflict Resolution // Encyclopedia of Optimization. Ed. by P.M. Pardalos, O.A. Prokopyev. Cham: Springer, 2023. P. 1-8.</mixed-citation></ref><ref id="B7"><label>7.</label><mixed-citation>Characklis G., Kirsch B., Ramsey J., Dillard K., Kelley C. Developing portfolios of water supply transfers // Water Resources Research. 2006. V. 42. No 5. P. 1-14.</mixed-citation></ref><ref id="B8"><label>8.</label><mixed-citation>Chen X., Chen X., Kelley C., Xu F., Zhang Z. A smoothing direct search method for Monte Carlo-based bound constrained composite nonsmooth optimization // SIAM Journal on Scientific Computing. 2018. V. 40. No 4. P. A2174- A2199.</mixed-citation></ref><ref id="B9"><label>9.</label><citation-alternatives><mixed-citation xml:lang="en">Habib M., Aljarah I., Faris H., Mirjalili S. Multi-objective particle swarm optimization: theory, literature review, and application in feature Selection for medical diagnosis // Evolutionary Machine Learning Techniques, Mirjalili S.,Faris H., Aljarah I. (eds). Algorithms for Intelligent Systems. Springer, Singapore. 2020. P. 175-201.</mixed-citation><mixed-citation xml:lang="ru">Habib M., Aljarah I., Faris H., Mirjalili S. Multi-objective particle swarm optimization: theory, literature review, and application in feature Selection for medical diagnosis // Evolutionary Machine Learning Techniques, Mirjalili S., Faris H., Aljarah I. (eds). Algorithms for Intelligent Systems. Springer, Singapore. 2020. P. 175-201.</mixed-citation></citation-alternatives></ref><ref id="B10"><label>10.</label><mixed-citation>Rani J.A.E., Kirubakaran E., Juliet S., Zoraida B.S.E. Supervised hybrid particle swarm optimization with entropy (PSO-ER) for feature selection in health care domain // International Conference on Innovative Computing and Communications. Advances in Intelligent Systems and Computing. Springer, Singapore. 2022. V. 1387. P. 797-805.</mixed-citation></ref><ref id="B11"><label>11.</label><mixed-citation>Burachik R.S., Kaya C.Y., Rizvi M.M. Algorithms for generating Pareto fronts of multi-objective integer and mixedinteger programming problems // Engineering optimization. 2022. V. 54. No 8. P. 1413-1425.</mixed-citation></ref><ref id="B12"><label>12.</label><mixed-citation>Wang F., Zhang H., Zhou A. A particle swarm optimization algorithm for mixed-variable optimization problems // Swarm and evolutionary computation. 2021. V. 60. P. 100808.</mixed-citation></ref><ref id="B13"><label>13.</label><citation-alternatives><mixed-citation xml:lang="en">Hodashinsky, I. A. Methods for Improving the Efficiency of Swarm Optimization Algorithms. A Survey // Automation and Remote Control. 2021. V. 82. No 6. P. 935-967.</mixed-citation><mixed-citation xml:lang="ru">Ходашинский И.А. Методы повышения эффективности роевых алгоритмов оптимизации // Автоматика и телемеханика. 2021. № 6. С. 3-45.</mixed-citation></citation-alternatives></ref><ref id="B14"><label>14.</label><citation-alternatives><mixed-citation xml:lang="en">Handbook of methaheuristics. Ed. by M. Gendreau, J.-Yv. Potvin. International Series in Operations Research &amp; Management Science, 272. Cham: Springer, 2019. P. 604.</mixed-citation><mixed-citation xml:lang="ru">Handbook of methaheuristics. Ed. by M. Gendreau, J.-Yv. Potvin // International Series in Operations Research &amp; Management Science, 272. Cham: Springer, 2019. P. 604.</mixed-citation></citation-alternatives></ref><ref id="B15"><label>15.</label><citation-alternatives><mixed-citation xml:lang="en">Eichfelder G., Stein O., Warnow L. A Solver for multi- objective mixed-integer convex and nonconvex optimization // Journal of optimization theory and applications. 2023. V. 200. P. 1-31.</mixed-citation><mixed-citation xml:lang="ru">Eichfelder G., Stein O., Warnow L. A Solver for multiobjective mixed-integer convex and nonconvex optimization // Journal of optimization theory and applications. 2023. V. 200. P. 1-31.</mixed-citation></citation-alternatives></ref><ref id="B16"><label>16.</label><citation-alternatives><mixed-citation xml:lang="en">Black box optimization, machine learning, and no-free lunch theorems. Ed. by P.M. Pardalos, V. Rasskazova, M.N. Vrahatis. Springer optimization and its applications,170. Cham: Springer, 2021. 388 p.</mixed-citation><mixed-citation xml:lang="ru">Black box optimization, machine learning, and no-free lunch theorems. Ed. by P.M. Pardalos, V. Rasskazova, M.N. Vrahatis. Springer optimization and its applications,170. Cham: Springer, 2021. P. 388.</mixed-citation></citation-alternatives></ref><ref id="B17"><label>17.</label><mixed-citation>Deb K., Agrawal S., Pratap A., Meyarivan T. A fast and elitist multiobjective genetic algorithm: NSGA-II // IEEE Transactions on Evolutionary Computation. 2002. V. 6. P. 182-197.</mixed-citation></ref><ref id="B18"><label>18.</label><mixed-citation>Murata T., Ishibuchi H., Tanaka H. Multi-objective genetic algorithm and its applications to flowshop scheduling // Computers and industrial engineering. 1996. V. 30. No 4. P. 957-968.</mixed-citation></ref><ref id="B19"><label>19.</label><mixed-citation>Wang W., Li K., Jalil H., Wang H. An improved estimation of distribution algorithm for multi-objective optimization problems with mixed-variable // Neural Computing and Applications. 2022. V. 34. P. 19703-19721.</mixed-citation></ref><ref id="B20"><label>20.</label><citation-alternatives><mixed-citation xml:lang="en">Estimation of distribution algorithms: genetic algorithms and evolutionary computation. Ed. by P. Larranaga, J. A. Lozano. A new tool for evolutionary computation, 2. New York: Springer, 2002. 383 p.</mixed-citation><mixed-citation xml:lang="ru">Estimation of distribution algorithms: genetic algorithms and evolutionary computation. Ed. by P. Larranaga, J. A. Lozano. A new tool for evolutionary computation, 2. New York: Springer, 2002. P. 383.</mixed-citation></citation-alternatives></ref><ref id="B21"><label>21.</label><mixed-citation>Bengoetxea E. Estimation of distribution algorithms: A new evolutionary computation approach for graph matching problems // Energy minimization methods in computer vision and pattern recognition. Ed. by M. Figueiredo, J. Zerubia, A.K. Jain. Lecture notes in computer science, 2134. Berlin: Springer, 2001. P. 454-469.</mixed-citation></ref><ref id="B22"><label>22.</label><mixed-citation>Zhang Q., Li H. MOEA/D: A multiobjective evolutionary algorithm based on decomposition // IEEE Transactions on evolutionary computation. 2007. V. 11. No 6. P. 712-731.</mixed-citation></ref><ref id="B23"><label>23.</label><mixed-citation>Tong W., Chowdhury S., Messac A. A multi-objective mixed-discrete particle swarm optimization with multi-domain diversity preservation // Structural and multidisciplinary optimization. 2016. V. 53. P. 471-488.</mixed-citation></ref><ref id="B24"><label>24.</label><citation-alternatives><mixed-citation xml:lang="en">Chowdhury S., Tong W., Messac A., Zhang J. A mixed- discrete particle swarm optimization algorithm with explicit diversity-preservation // Structural and multidisciplinary optimization. 2013. V. 47. P. 367-388.</mixed-citation><mixed-citation xml:lang="ru">Chowdhury S., Tong W., Messac A., Zhang J. A mixeddiscrete particle swarm optimization algorithm with explicit diversity-preservation // Structural and multidisciplinary optimization. 2013. V. 47. P. 367-388.</mixed-citation></citation-alternatives></ref><ref id="B25"><label>25.</label><mixed-citation>Mokarram V., Banan M.R. A new PSO-based algorithm for multi-objective optimization with continuous and discrete design variables // Structural and multidisciplinary optimization. 2018. V. 57. P. 509-533.</mixed-citation></ref><ref id="B26"><label>26.</label><mixed-citation>Coello Coello C.A., Lechuga M.S. MOPSO: A proposal for multiple objective particle swarm optimization // Proceedings of the 2002 Congress on Evolutionary Computation, CEC IEEE. 2002. P. 1051-1056.</mixed-citation></ref><ref id="B27"><label>27.</label><mixed-citation>Kennedy J., Eberhart R.C. A discrete binary version of the particle swarm algorithm. // International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation. IEEE. 1997. P. 4104-4108.</mixed-citation></ref><ref id="B28"><label>28.</label><mixed-citation>Yang X.-S., Deb S. Engineering optimisation by cuckoo search // International Journal Mathematical Modelling and Numerical Optimisation. 2010. V. 1. No 4. P. 330-343.</mixed-citation></ref><ref id="B29"><label>29.</label><mixed-citation>Yang X.-S., Deb S. Cuckoo search: recent advances and applications // Neural Computing and Applications. 2014. V. 24. No 1. P. 169-174.</mixed-citation></ref><ref id="B30"><label>30.</label><mixed-citation>Tang J., Liu G., Pan Q.T. A review on representative swarm intelligence algorithms for solving optimization problems: Applications and trends // IEEE/CAA Journal of Automatica Sinica. 2021. V. 8. No 10. P. 1627-1643.</mixed-citation></ref><ref id="B31"><label>31.</label><mixed-citation>Viswanathan G., Afanasyev V., Buldyrev S., Havlin S. et al. Levy flights in random searches // Physica A: Statistical Mechanics and its Applications. 2000. V. 282. P. 1-12.</mixed-citation></ref><ref id="B32"><label>32.</label><mixed-citation>Viswanathan G., Bartumeus F., Buldyrev S., Catalan J. et al. Levy flight random searches in biological phenomena // Physica A: Statistical Mechanics and its Applications. 2002. V. 314. P. 208-213.</mixed-citation></ref><ref id="B33"><label>33.</label><mixed-citation>Mantegna R.N. Fast, accurate algorithm for numerical simulation of Levy stable stochastic processes // Physical Review E. 1994. V. 49. No 5. P. 4677-4683.</mixed-citation></ref><ref id="B34"><label>34.</label><mixed-citation>Yang X.-S. Genetic Algorithms // Nature-Inspired Optimization Algorithms (Second Edition). Academic Press, 2021. P. 91-100.</mixed-citation></ref><ref id="B35"><label>35.</label><mixed-citation>Zitzler E., Deb K., Thiele L. Comparison of multiobjective evolutionary algorithms: empirical results // Evolutionary Computation. 2000. V. 2. P. 173-195.</mixed-citation></ref><ref id="B36"><label>36.</label><mixed-citation>Deb K., Thiele L., Laumanns M., Zitzler E. Scalable test problems for evolutionary multiobjective optimization // Evolutionary Multiobjective Optimization, Theoretical Advances and Applications. Ed. by Abraham A., Jain L., Goldberg. Advanced Information and Knowledge Processing. London: Springer, 2005. P. 105-145.</mixed-citation></ref><ref id="B37"><label>37.</label><mixed-citation>Zhang Q., Zhou A., Jin Y. RM-MEDA: A regularity modelbased multiobjective estimation of distribution algorithm // IEEE Transactions on Evolutionary Computation. 2008. V. 12. No 1. P. 41-63.</mixed-citation></ref><ref id="B38"><label>38.</label><mixed-citation>Herrera F., Lozano M., Verdegay J.L. Tackling real-coded genetic algorithms: operators and tools for behavioural analysis // Artificial Intelligence Review. 1998. V. 12. P. 265-312.</mixed-citation></ref><ref id="B39"><label>39.</label><citation-alternatives><mixed-citation xml:lang="en">Glantz S.A. Primer of biostatics. New York: McGraw-Hill, 1997. 473p.</mixed-citation><mixed-citation xml:lang="ru">Гланц С. Медико-биологическая статистика. Пер с англ. М.: Практика, 1998. 459с.</mixed-citation></citation-alternatives></ref></ref-list></back></article>
