.png){kind=icon}
返回
Elite opposition-based flower pollination algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2015.01.110.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Flower pollination algorithm
Elite opposition-based learning
Metaheuristic optimization algorithm
Function optimization
Structure engineering design
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
2.5W
被引数:
6.5W
机构
引用论文
Constraint-handling in genetic algorithms through the use of dominance-based tournament selection
PREAI
分享收藏Clinical prediction models for mortality and functional outcome following ischemic stroke: A systematic review and meta-analysis.png)
PLOS ONE
OAAI
PLOS ONEIF0
OAAI分享收藏
查看更多内容