from 01.01.2024 until now
Russian Federation
AO "Nauchno-issledovatel'skiy institut elektronnoy tehniki"
Russian Federation
004.023
This paper investigates and compares various heuristic optimization algorithms used to solve problems where strict analytical solutions are lacking. Three algorithms are considered: genetic algorithms, simulated annealing, and firefly swarm optimization. Each of these methods is based on random search principles and is inspired by natural processes and the idea of role intelligence, where the behavior of individual individuals in accordance with simple rules allows finding a quasi-optimal solution. Genetic algorithms use selection, crossing-over and mutation mechanisms to find optimal solutions. The simulated annealing algorithm is inspired by the process of cooling a solid crystalline body, allowing the system to transition to less favorable states with a certain probability. The firefly swarm optimization algorithm is based on the behavior of fireflies, where agents move towards brighter individuals, which means a better value of the objective function, or move in a random direction. The article contains a computational experiment that allows us to compare the efficiency of algorithms by two criteria: proximity to the global minimum and the number of objective function calculations. The results showed that the simulated annealing algorithm is the simplest and most effective for optimizing two-dimensional multimodal functions, while genetic algorithms and the firefly algorithm require more complex parameter settings.
genetic algorithms, swarm intelligence, optimization algorithms, heuristic algorithms, simulated annealing, firefly swarm.
1. Trushin, S. M. Application of evolutionary modeling and genetic algorithms for solving optimization problems / S. M. Trushin, A. K. Titlyanov // Scientific aspect. - 2024. - Vol. 46, No. 4. - P. 6138-6149.
2. Aarts E., Korst J., Michiels W. Simulated annealing // Operations Research. 1992. N 40(1). P. 113-125.
3. Kostenko, V. A. Combinatorial optimization algorithms combining greedy strategies and limited enumeration / V. A. Kostenko // Bulletin of the Russian Academy of Sciences. Theory and control systems. - 2017. - No. 2. - P. 48-56. DOI:https://doi.org/10.7868/S0002338817020135
4. Kostenko, V.A. Combinatorial optimization algorithms combining greedy strategies and limited enumeration / V.A. Kostenko // Bulletin of the Russian Academy of Sciences. Control Theory and Systems. - 2017. - No. 2. - P. 48-56. DOI:https://doi.org/10.7868/S0002338817020135
5. Gladkov L.A., Kureichik V.V., Kureichik V.M. Genetic algorithms / Ed. V.M. Kureichik. - 2nd ed., corrected. and add. - M.: FIZMATLIT, 2010. - 368 p. — ISBN 978-5-9221-0510-1.
6. Zhabin D.A. Automated synthesis of schematic diagrams and topology of low-noise microwave amplifiers based on a genetic algorithm / D.A. Zhabin [et al.] // TUSUR Reports. - 2017. - Vol. 20, No. 3. - Pp. 132-143
7. Knysh, D.S. Genetic algorithm for routing switching blocks / D.S. Knysh, V.M. Kureichik // News of higher educational institutions. Electronics. - 2009 - No. 5 (79). - Pp. 28-34
8. Holland J.N. Adaptation in Natural and Artificial Systems. Ann Arbor, Michigan: Univ. of Michigan Press, 1975.
9. Golberg D.E. Genetic Algorithms in Search, Optimization and Machine Learning. 61 Addison-Wesley, Reading, Mass., 1989.
10. D. Kovalenko, V. Kostenko A Genetic Algorithm for Construction of Recognizers of Anomalies in Behavior of Dynamical Systems // Proceedings of the IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications, IEEE Press, China. 2010. - pp.258-263.
11. Software implementation of the simulated annealing method and analysis of its efficiency / A. V. Zemlyansky, G. A. Shtykov // Bulletin of Penza State University. - 2017. - No. 4 (20). - P. 76-81
12. Kostenko V. A., Kalashnikov A. V. Study of various modifications of simulated annealing algorithms for solving the problem of constructing multiprocessor schedules // Discrete models in the theory of control systems. Proceedings of the VII International Conference. Moscow: MAKS Press, 2006. - P. 179-184.
13. Zorin, D. A. Estimation of the convergence of the simulated annealing algorithm for the problem of constructing multiprocessor schedules / D. A. Zorin // Bulletin of Moscow University. Series 15: Computational Mathematics and Cybernetics. – 2014. – No. 2. – P. 53-59. – EDN SATXOZ.
14. Van Laarhoven P.J., Aarts E.H., Lenstra J.K. Job shop scheduling by simulated annealing // Operations Re-search. 1992. N 40(1) P. 113-125.
15. Hongxia Liu, Shiliang Chen, Yongquan Zhou. A novel hybrid optimization algorithm based on glowworm swarm and fish school, Journal of Computational Information Systems, 2010, No. 6 (13), pp. 4533-4542
16. Piotr and Oramus. Improvements to glowworm swarm optimization algorithm, Computer Science, 2010, No. 11, pp. 7-20.
17. Karpenko A.P. Population algorithms for global continuous optimization. Review of new and little-known algorithms], Information Technologies, 2012, No. 7, pp. 1-32.
18. Karpenko A.P. Hybrid population-based algorithms for parametric optimization of design solutions], Information Technologies, 2013, No. 12, pp. 6-15.
19. Kureichik, V.V. Parametric optimization algorithm based on the firefly swarm behavior model / V.V. Kureichik, D.V. Zaruba, D.Yu. Zaporozhets // Bulletin of the Southern Federal University. Technical sciences. - 2015. - No. 6 (167). - P. 6-15
20. Karpenko, A.P. Population algorithms for global search engine optimization. Review of new and little-known algorithms / A.P. Karpenko // Information technologies. - 2012. - No. S7. - P. 1-32. - EDN PBMPVF.
21. Bulavchuk A., Semenova D. Genetic algorithm based on idempotent algebra methods for RCPSP // 2021 IEEE 15th International Conference on Application of Information and Communication Technologies (AICT). — 2021. — P. 1–4.
22. Bulavchuk A., Semenova D. Genetic algorithm based on idempotent algebra methods for RCPSP // 2021 IEEE 15th International Conference on Application of Information and Communication Technologies (AICT). — 2021. — P. 1–4.
23. Bulavchuk A., Semenova D. Application of idempotent algebra methods in genetic algorithm for solving the scheduling problem // Prikl. Diskr. Mat. - 2022. - No. 58. - P. 112–124. (in Russian)
24. Bulavchuk A., Semenova D. Features of risk analysis in solving RCPSP using the GASPIA algorithm // 2022 IEEE International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON). — 2022. — P. 970–973.
25. Pan N.-H., Hsiang T.-C., Chen W.-T. Using hybrid simu-lated annealing algorithm in resource-constrained project scheduling problem // The International Journal of Organizational Innovation. — 2020. — Vol. 12. — P. 25–46.
26. Bulavchuk A., Semenova D. Application of idempotent algebra methods in genetic algorithm for solving the scheduling problem // Prikladnaya Diskretnaya Matemat-ika. — 2023. — P. 112–124.
27. Kozlov A., Kondratenko Yu. Search for optimal membership functions of fuzzy systems based on bio-inspired evolutionary algorithms. Part 1. Step-by-step method // International Scientific Technical Journal Problems of Control and Informatics. — 2020. — No. 66. — P. 55–75.
28. Zhirnova O.V., Tuleushova R.Zh. Intelligent flight control systems based on artificial intelligence // Bulletin of the Civil Aviation Academy. — 2024.
29. Swamy E.N. Automatic timetable generation using genet-ic algorithm // Journal of Information Studies & Technology (JIS&T). — 2025. — Vol. 33.
30. Naaman D., Ahmed B., Ibrahim I. Optimization by na-ture: A review of genetic algorithm techniques // The Indonesian Journal of Computer Science. — 2025.
31. Tang W. Optimization of urban terminal delivery routes using fuzzy genetic algorithm and its practical application // Journal of Computational Methods in Sciences and Engineering. — 2025.
32. Slowik A., Ezugwu A., Wagdy A. Swarm intelligence algorithms and their engineering applications. — 2024.
33. Kozlov A., Kondratenko Yu. Search for optimal membership functions of fuzzy systems based on bio-inspired evolutionary algorithms. Part 1. Step-by-step method // International Scientific Technical Journal Problems of Control and Informatics. — 2020. — No. 66. — P. 55–75.
