一种新型的混沌步长果蝇优化算法  

A novel fruit fly optimization algorithm with chaotic step

作　　者：张铸[1] 饶盛华 张仕杰 ZHANG Zhu;RAO Sheng-hua;ZHANG Shi-jie(College of Information and Electrical Engineering,Hunan University of Science and Technology,Xiangtan 411201;National-Local Joint Engineering Laboratory of Marine Mineral Resources Exploration Equipment and Safety Technology,Hunan University of Science and Technology,Xiangtan 411201,China)

机构地区：[1]湖南科技大学信息与电气工程学院,湖南湘潭411201 [2]湖南科技大学海洋矿产资源探采装备与安全技术国家地方联合工程实验室,湖南湘潭411201

出　　处：《计算机工程与科学》2020年第4期755-760,共6页Computer Engineering & Science

基　　金：国家自然科学基金(51477047,61503132);湖南省自然科学湘潭联合基金(2016JJ5026);湖南省研究生科研创新项目(CX2016B604)。

摘　　要：针对果蝇优化算法存在算法易早熟、收敛不足的问题,将Hénon混沌映射引用为步长因子,提出了一种混沌步长果蝇优化算法。利用Hénon映射所产生的混沌现象具有良好的遍历性、多样性的特点来改进果蝇算法的固定步长,并增加放大系数以提高算法的全局和局部搜索能力以及跳出局部最优解的能力。对10个经典测试函数进行测试,并与多个算法进行了对比分析,研究结果表明,该算法具有较高的全局搜索和跳出局部最优解的能力。Aiming at the problems of early maturity and insufficient convergence of fruit fly optimization algorithm(FOA), a novel FOA with chaotic step is proposed by using Hénon chaotic mapping as the step factor. The proposed algorithm uses the good ergodicity and diversity of the chaotic phenomena generated by Hénon mapping to improve the fixed step of FOA, and increase the magnification coefficient to improve the global and local search ability and the capability of jumping out the local optimal solutions. The proposed algorithm is verified by 10 classical test functions, and compared with several algorithms. The results show that the proposed algorithm has a high ability of global search and jumping out of local optimal solutions.

关 键 词：果蝇优化算法 HÉNON映射 混沌步长果蝇算法 测试函数 

分 类 号：TM352[电气工程—电机]