一种新的双策略进化果蝇优化算法

A novel double strategies evolutionary fruit fly optimization algorithm

标准果蝇优化算法(fruit fly optimization algorithm, FOA)在迭代寻优的过程中,整个果蝇群体只向最优个体靠近,这导致算法极易陷入局部最优,从而引起早熟收敛的问题。针对该问题,提出一种新的双策略进化果蝇优化算法(a novel double strategies evolutionary fruit fly optimization algorithm, DSEFOA)。提出的一种新的群体分割策略,将果蝇群体动态地划分为精英子群和普通子群;对于精英子群,引入混沌变量引导果蝇个体在其附近搜索食物,优化其局部搜索能力;对于普通子群,引入权重因子改进标准FOA的随机搜索方式,执行全局搜索,加快收敛速度。DSEFOA算法针对不同进化水平的果蝇个体采用不同的策略更新进化,充分地提升了整个群体的寻优搜索能力。8个测试函数的仿真试验结果表明,DSEFOA算法有比标准FOA算法更好的优化性能。

The problem of premature convergence caused by trapping into local optimum, which resulted form the fact that all the individuals were only attracted by the best one in the standard fruit fly optimization algorithm(FOA), was common. In order to overcome this demerit, a novel double strategies evolutionary fruit fly optimization algorithm(DSEFOA) was proposed. The whole group was divided into elite subgroup and ordinary subgroup dynamically based on a proposed new group partitioning strategy. Then an improved searching method with chaotic variable was used in the elite subgroup to improve the individual?s local searching capability. Meanwhile, an improved standard FOA-based random searching method with weighting factors was used in the ordinary subgroup to enhance its global searching capability, as well accelerated the convergence. The searching capability of both superior and inferior individuals could be effectively improved in DSEFOA by using different strategies on different evolutionary levels of these individuals. The experimental results showed that DSEFOA had better optimization performance than the standard FOA.