摘要
花授粉算法是一种新型启发式优化算法,算法存在易陷入局部最优、后期收敛速度慢等缺陷,为了进一步提高花授粉算法的寻优性能,在异花授粉过程中引入t分布变异算子,提出了一种基于t分布的自适应花授粉算法(tFPA).通过7个标准测试函数进行测试比较,并对改进算法的时间复杂度进行分析,仿真结果表明,改进算法是可行有效的,其寻优速度、寻优精度以及鲁棒性均有很大程度的改善.
The flower pollination algorithm is a new heuristic optimization algorithm Which is easy to fall into the local optimum and whose convergence rate is slow. In order to improve the performance of the flower pollination algorithm, the t-distribution mutation operator is introduced in the process of cross-pollination,and the flower pollination algorithm(tFPA)based on t distribution is proposed. The improved algorithm in this paper is tested by 7 standard test functions, and the time complexity of the improved algorithm is analyzed.The simulation results show that the improved algorithm is feasible and effective, and its optimization speed, optimization accuracy, and robustness are all largely improve.
作者
韩斐斐
刘升
赵齐辉
HAN Fei-fei;LIU Sheng;ZHAO Qi-hui(School of Management,Shanghai University of Engineering Science,Shanghai 201620,China)
出处
《数学的实践与认识》
北大核心
2019年第2期157-165,共9页
Mathematics in Practice and Theory
基金
国家自然科学基金(61075115
61673258)
上海工程技术大学研究生科研创新项目(E3-0903-17-01182)
关键词
花授粉算法
T分布
适应度值
时间复杂度
pollination algorithm
t distribution
fitness value
time complexity
