Back to Search
Start Over
Cone Search: A Simple Metaheuristic Optimization Algorithm.
- Source :
-
IAENG International Journal of Applied Mathematics . Dec2022, Vol. 52 Issue 4, p838-845. 8p. - Publication Year :
- 2022
-
Abstract
- This paper demonstrates a novel simple metaheuristic algorithm, the cone search (CS). This name comes from the distinct strategy of CS in searching the suboptimal solution. In the early iteration, its local search space is wide to facilitate exploration. The local search space is reduced linearly during the iteration so that the exploration changes to exploitation gradually. As a swarm intelligence, CS contains several autonomous agents and a collective intelligence called memory. This memory consists of several best solutions. In this work, CS is challenged to find the global optimal of 23 benchmark functions. In the simulation, CS is compared with four metaheuristic algorithms: particle swarm optimization (PSO), marine-predators algorithm (MPA), Komodo mlipir algorithm (KMA), and pelican optimization algorithm (POA). The result shows that CS performs well in solving these 23 functions. Moreover, it can find the global optimal of six fixeddimension multimodal functions: Branin, six hump camel, Hartman 6, Shekel 5, Shekel 7, and Goldstein price. CS beats PSO, MPA, KMA, and POA in solving 23, 22, 21, 22 functions respectively. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 19929978
- Volume :
- 52
- Issue :
- 4
- Database :
- Academic Search Index
- Journal :
- IAENG International Journal of Applied Mathematics
- Publication Type :
- Academic Journal
- Accession number :
- 160516469