1673-159X

CN 51-1686/N

一种基于随机数扰动变异的果蝇优化算法

Fruit Fly Optimization Algorithm Based on Random Numbers Mutation Operator

  • 摘要: 针对果蝇优化算法在解决现实中复杂高维优化问题时不稳定、精度不高、易陷入局部最优、移动步长取值不易确定的缺陷,提出一种改进的果蝇优化算法。改进算法对每代果蝇群体的最优解实施随机数扰动变异,作为果蝇个体位置更新的移动步长,并为移动步长设置动态惯性扰动因子,使移动步长的取值具有自适应性。在8个高维峰值函数上做性能分析实验。结果表明:改进算法在收敛精度和收敛速度上较对比算法有显著提升,在较高目标精度下的寻优成功率达到100%。说明改进算法通过对果蝇群体的最优解实施随机数扰动变异,能够增加果蝇个体分布的离散程度,扩展果蝇群体的多样性,使果蝇更易跳出局部极值的束缚,显著提高算法的收敛精度和收敛速度。

     

    Abstract: The fruit fly optimization algorithm has low convergence precision and easily falls into local optimum. Its moving step value is not easy to determine, which is weak to solve complex optimization problems. Therefore, an improved fruit fly optimization algorithm is proposed. The improved algorithm employs a random numbers mutation operator to disturb the best position coordinates value of each generation of the fruit fly population as the moving step, which is perturbed by setting the dynamic inertia disturbance factor. Thus, the value of the moving step length is adaptive. The experimental results of eight high-dimensional peak function show that the improved algorithm has higher convergence precise and faster convergence speed than those of the comparison algorithm, and the success rate of optimization is 100% under the higher target precision. Therefore, the improved algorithm which a random numbers mutation operator is employed can increase the discrete degree of the individual distribution of the fruit fly and expand the diversity of the fruit fly population so that the improved algorithm can improve the abilities of seeking the global excellent result and evolution speed.

     

/

返回文章
返回