张强, 刘丽杰. 一种动态分组多策略果蝇优化算法[J]. 信息与控制, 2018, 47(4): 479-485. DOI: 10.13976/j.cnki.xk.2018.7062
引用本文: 张强, 刘丽杰. 一种动态分组多策略果蝇优化算法[J]. 信息与控制, 2018, 47(4): 479-485. DOI: 10.13976/j.cnki.xk.2018.7062
ZHANG Qiang, LIU Lijie. Dynamic Grouping and Multi-strategy Fruit Fly Optimization Algorithm[J]. INFORMATION AND CONTROL, 2018, 47(4): 479-485. DOI: 10.13976/j.cnki.xk.2018.7062
Citation: ZHANG Qiang, LIU Lijie. Dynamic Grouping and Multi-strategy Fruit Fly Optimization Algorithm[J]. INFORMATION AND CONTROL, 2018, 47(4): 479-485. DOI: 10.13976/j.cnki.xk.2018.7062

一种动态分组多策略果蝇优化算法

Dynamic Grouping and Multi-strategy Fruit Fly Optimization Algorithm

  • 摘要: 针对基本果蝇优化算法求解精度低和不能处理最优位置在负区间优化问题的缺点,提出了一种动态分组多策略果蝇优化算法.利用自适应分组策略对种群进行分子群寻优,通过精英池的个体来利用差分变异算子改进最优个体的寻优行为,在迭代后期利用粒子群算法进化优势子群增强求解精度,利用反向混沌算子进化拓展子群避免陷入局部最优解.选取2类具有代表性的测试函数验证算法性能,并与GSA(gravitational search algorithm)、FOA及两种改进FOA的优化结果进行对比,结果表明该算法具有很好的收敛精度和计算速度.

     

    Abstract: The fruit fly optimization algorithm (FOA) suffers from low solution precision and failure with respect to position optimization in the negative interval. We propose a dynamic grouping and multi-strategy fruit fly optimization algorithm that divides the population into the subgroups to find the optimal solution by the use of adaptive grouping strategies. It also improves the optimization behavior of the optimal individual using a differential mutation operator and the elite pool individual. In later iterations, we evolve dominant subgroups by the particle swarm optimization algorithm to enhance the accuracy of the solution, and evolve the extended subgroups by an inverse chaos operator to avoid a local optimal solution. We select two representative test functions to verify the performance of the algorithm and compare the optimization results of the discrete gradient method-FOA (DGM-FOA) with the gravitational search algorithm (GSA), the FOA and two improved FOAs. The results show that the proposed algorithm has good convergence accuracy and computation speed.

     

/

返回文章
返回