Circle Search Algorithm: A Geometry-Based Metaheuristic Optimization Algorithm

Mohammed H. Qais, Hany M. Hasanien, Rania A. Turky, Saad Alghuwainem, Marcos Tostado-Véliz and Francisco Jurado
Additional contact information
Mohammed H. Qais: Centre for Advances in Reliability and Safety, Hong Kong
Hany M. Hasanien: Electrical Power and Machines Department, Faculty of Engineering, Ain Shams University, Cairo 11517, Egypt
Rania A. Turky: Electrical Engineering Department, Faculty of Engineering and Technology, Future University in Egypt, Cairo 11835, Egypt
Saad Alghuwainem: Electrical Engineering Department, College of Engineering, King Saud University, Riyadh 11421, Saudi Arabia
Marcos Tostado-Véliz: Department of Electrical Engineering, University of Jaén, 23700 Linares, Spain
Francisco Jurado: Department of Electrical Engineering, University of Jaén, 23700 Linares, Spain

Mathematics, 2022, vol. 10, issue 10, 1-27

Abstract: 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.

Keywords: algorithms; circle search algorithm; metaheuristics; numerical optimization; optimization methods (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2022
References: View complete reference list from CitEc
Citations: View citations in EconPapers (10)

Downloads: (external link)
https://www.mdpi.com/2227-7390/10/10/1626/pdf (application/pdf)
https://www.mdpi.com/2227-7390/10/10/1626/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:10:y:2022:i:10:p:1626-:d:812466

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().