Circle Search Algorithm: A Geometry-Based Metaheuristic Optimization Algorithm
This paper presents a novel metaheuristic optimization algorithm inspired by the geometrical features of circles, called the circle search algorithm (CSA). The circle is the most well-known geometric object, with various features including diameter, center, perimeter, and tangent lines. The ratio be...
| Authors: | , , , , , |
|---|---|
| Format: | article |
| Status: | Versión aceptada para publicación |
| Publication Date: | 2022 |
| Country: | España |
| Institution: | Universidad de Jaén |
| Repository: | RUJA. Repositorio Institucional de la Producción Científica de la Universidad de Jaén |
| OAI Identifier: | oai:ruja.ujaen.es:10953/3587 |
| Online Access: | https://www.mdpi.com/2227-7390/10/10/1626 https://hdl.handle.net/10953/3587 |
| Access Level: | Open access |
| Keyword: | Algorithms Circle search algorithm Metaheuristics Numerical optimization Optimization methods |
| Summary: | This paper presents a novel metaheuristic optimization algorithm inspired by the geometrical features of circles, called the circle search algorithm (CSA). The circle is the most well-known geometric object, with various features including diameter, center, perimeter, and tangent lines. The ratio between the radius and the tangent line segment is the orthogonal function of the angle opposite to the orthogonal radius. This angle plays an important role in the exploration and exploitation behavior of the CSA. To evaluate the robustness of the CSA in comparison to other algorithms, many independent experiments employing 23 famous functions and 3 real engineering problems were carried out. The statistical results revealed that the CSA succeeded in achieving the minimum fitness values for 21 out of the tested 23 functions, and the p-value was less than 0.05. The results evidence that the CSA converged to the minimum results faster than the comparative algorithms. Furthermore, high-dimensional functions were used to assess the CSA’s robustness, with statistical results revealing that the CSA is robust to high-dimensional problems. As a result, the proposed CSA is a promising algorithm that can be used to easily handle a wide range of optimization problems. |
|---|