.png){kind=icon}
Return
Elite opposition-based flower pollination algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2015.01.110.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Flower pollination algorithm (FPA) is a novel metaheuristic optimization algorithm with quick convergence, but its population diversity and convergence precision can be limited in some applications. In order to enhance its exploitation and exploration abilities, in this paper, an elite opposition-based flower pollination algorithm (EOFPA) has been applied to functions optimization and structure engineering design problems. The improvement involves two major optimization strategies. Global elite opposition-based learning enhances the diversity of the population, and the local self-adaptive greedy strategy enhances its exploitation ability. An elite opposition-based flower pollination algorithm is validated by 18 benchmark functions and two structure engineering design problems. The results show that the proposed algorithm is able to obtained accurate solution, and it also has a fast convergence speed and a high degree of stability. (C) 2015 Elsevier B.V. All rights reserved.
Keywords:
Flower pollination algorithm
Elite opposition-based learning
Metaheuristic optimization algorithm
Function optimization
Structure engineering design
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.5
Papers:
2.5W
Citations:
6.5W
Organization
Cited Papers
Constraint-handling in genetic algorithms through the use of dominance-based tournament selection
PREAI
ShareSaveShareSaveShareSaveShareSaveShareSaveClinical prediction models for mortality and functional outcome following ischemic stroke: A systematic review and meta-analysis.png)
PLOS ONE
OAAI
PLOS ONEIF0
OAAIShareSave
View more