ANALYSIS OF EVOLUTIONARY ALGORITHMS OF GLOBAL SEARCH OPTIMIZATION

DOI: 10.31673/2786-8362.2024.029215

Authors

  • В. В. Бриль, (Bryl V.V.) State University of Information and CommunicationTechnologies, Kyiv, Ukraine.
  • Ю. В. Задонцев, (Zadontsev Y.V.) State University of Information and CommunicationTechnologies, Kyiv, Ukraine.

DOI:

https://doi.org/10.31673/2786-8362.2024.029215

Abstract

The article provides a detailed analysis of evolutionary algorithms of global search engine optimization, in
particular the genetic algorithm (GA) and the modified algorithm for searching a school of fish (FSS). The
strengths and weaknesses of the selected algorithms are investigated, their efficiency and adaptability are
evaluated. The main scientific result is the development and testing of FSS modifications, which showed
increased efficiency for tasks with a large number of variables. It is recommended to use modified
algorithms in optimization tasks in various industries where complex target functions are present, in
particular in engineering, finance and logistics. The proposed system uses an evolutionary approach to adapt
and improve search algorithms, including the use of genetic algorithms to evaluate and select the most
relevant results. This allows you to take into account the user's previous experience and generate results
that better meet his needs. The introduction of evolutionary algorithms into search engines can improve the
quality of results and provide a more personalized user experience.

Keywords: abstract, evolutionary algorithm, search engines

List of used literature:
1. Floudas C. A., Pardalos P. M. State of the Art in Global Optimization: Computational
Methods and Applications. New York City : Springer; 1996th edition, 2011. 664 p.
2. An Algorithm for the Traveling Salesman Problem / J. D. C. Little et al. 11th ed. FB &c Ltd,
Dalton House, 60 Windsor Avenue, London, SW19 2RR : Forgotten Books, 2018. 83 p.
3. Yang X.-S. Firefly algorithm, stochastic test functions and design optimisation. International
journal of bio-inspired computation. 2010. Vol. 2, no. 2. P. 78–84. URL:
https://doi.org/10.48550/arXiv.1003.1409.
4. Mehrabian A. R., Lucas C. A novel numerical optimization algorithm inspired from weed
colonization. Ecological informatics. 2006. Vol. 1, no. 4. P. 355–366. URL:
https://doi.org/10.1016/j.ecoinf.2006.07.003.
5. The Expanded Invasive Weed Optimization Metaheuristic for Solving Continuous and
Discrete Optimization Problems / H. Josiński et al. The Scientific World Journal. 2014. Vol. 2014. P.
1–14. URL: https://doi.org/10.1155/2014/831691.
6. Yang X.-S. Cuckoo search via Levy flights. in: Proc. of World Congress on Nature &
Biologically Inspired Computing. 2009. Vol. 1, no. 1. P. 210-214. URL:
https://doi.org/10.48550/arXiv.1003.1594.
7. Ibe O. C. Markov Processes for Stochastic Modeling. 2nd ed. Amsterdam, Netherlands :
Elsevier, 2013. 424 p.
8. Robbins H., Monro S. A Stochastic Approximation Method. 22nd ed. Virginia, USA. : Institute
of Mathematical Statistics, 1951. 407 p.

Published

2025-01-14

Issue

Section

Articles