改进萤火虫算法及其收敛性分析

萤火虫算法因具有结构简单、控制参数少、易于实现的特点而得到广泛的关注和应用, 但其易陷入局部最优导致过早收敛, 从而影响寻优精度。针对这一问题, 本文在位置更新规则中加入随机扰动因子, 并剔除了冗余的随机项, 以提高算法搜索能力; 引入位置置换变异和差分进化算法中的最优变异策略, 在保持种群多样性的同时, 增强算法跳出局部最优的能力。采用马尔可夫过程证明了算法以概率1收敛到全局最优。利用基准函数和装箱问题对算法进行仿真测试, 结果表明, 改进后的算法能够有效跳出局部最优, 对给出的所有问题均能找到理论最优解, 寻优精度和成功率有明显提升。

Improved firefly algorithm and its convergence analysis

The firefly algorithm has been widely concerned and applied because of its characteristics of simple structure, few control parameters and easy implementation, but it is easy to fall into local optimum, which leads to premature convergence and affects the optimization accuracy. To solve this problem, this paper adds a random factor into the individual location update rule to improve search capabilities, and the redundant random items are eliminated. To maintain the diversity of the population and enhance the capabilities of the algorithm to jump out of the local optimum, a position substitution mutation strategy and an optimal mutation strategy which come from the differential evolution algorithm are introduced. The Markov process is used to theoretically analyze the improved algorithm, and it is proved that the algorithm converges to the global optimum with probability of 1. The improved algorithm is simulated and tested using classic benchmark functions and the bin packing problem. Simulation results show that the improved algorithm can effectively jump out of the local optimum and find the theoretical optimal solution for all the given problems with better optimization accuracy and success rate.