.png){kind=icon}
返回
Modified Global Flower Pollination Algorithm and its Application for Optimization Problems
.png){kind=icon}
PRE
AI
DOI：10.1007/s12539-018-0295-2.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Flower Pollination Algorithm (FPA) has increasingly attracted researchers' attention in the computational intelligence field. This is due to its simplicity and efficiency in searching for global optimality of many optimization problems. However, there is a possibility to enhance its search performance further. This paper aspires to develop a new FPA variant that aims to improve the convergence rate and solution quality, which will be called modified global FPA (mgFPA). The mgFPA is designed to better utilize features of existing solutions through extracting its characteristics, and direct the exploration process towards specific search areas. Several continuous optimization problems were used to investigate the positive impact of the proposed algorithm. The eligibility of mgFPA was also validated on real optimization problems, where it trains artificial neural networks to perform pattern classification. Computational results show that the proposed algorithm provides satisfactory performance in terms of finding better solutions compared to six state-of-the-art optimization algorithms that had been used for benchmarking.
Keyword:
Flower Pollination Algorithm
Computational intelligent
Optimization problems
Exploration
Artificial neural networks
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
I
IF:
3.9
论文数:
962
被引数:
1.5K
机构
引用论文
Kinematic and kinetic differences in the execution of vertical jumps between people with good and poor ankle joint dorsiflexion踝关节背屈良好和不良的人在执行垂直跳跃时的运动学和动力学差异
PREAI
分享收藏Optimization of emission/economic dispatch using euclidean affine flower pollination algorithm (eFPA) and binary FPA (BFPA) in solar photo voltaic generation太阳能光伏发电中使用欧几里得仿射花授粉算法 (eFPA) 和二进制FPA (BFPA) 的排放/经济调度优化.png)
RENEWABLE ENERGY
RENEWABLE ENERGYIF9.1
PREAI
分享收藏
分享收藏
查看更多内容