.png){kind=icon}
.png){kind=icon}
Return
Adaptive chaotic spherical evolution algorithm
.png){kind=icon}
PRE
AI
DOI：10.1007/s12293-021-00341-w.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Nature-inspired metaheuristic algorithms are often based on the first-order difference hypercube search style to search for optimum solutions. In contrast, the spherical evolution algorithm (SE) employs a spherical search style. SE is very effective; however, there is still room for improvement. In this study, we added a chaotic local search (CLS) to the SE to improve its performance. This CLS uses information from several chaotic maps and records each instance of success. The recorded historical success information guides the CLS to choose the chaotic map for the next iteration. In our experiment, we compare the chaotic spherical evolution algorithm (CSE) with the original SE and other metaheuristic algorithms. The test set consists of 29 benchmark functions from the CEC2017 benchmark set and 22 real-world optimization problems from the CEC2011 set. Additionally, the new parameter introduced in the CSE has also been briefly discussed. Experimental results indicate that the proposed CSE significantly performs better than its competitors.
Keywords:
Nature-inspired metaheuristic algorithm
Spherical evolution algorithm
Chaotic local search
Chaotic map
Chaotic sequence
Historical information
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
2.3
Papers:
453
Citations:
718