计算机工程与应用2019，Vol.55Issue(19)：74-80,222,8.DOI:10.3778/j.issn.1002-8331.1806-0421
基于动态全局搜索和柯西变异的花授粉算法
Flower Pollination Algorithm Based on Dynamic Global Search and Cauchy Mutation
摘要
Abstract
Aiming at the shortages of basic Flower Pollination Algorithm(FPA)with slow convergence speed, low search precision and easy to fall into local optimum, a new algorithm based on dynamic global search and Cauchy mutation DCFPA is proposed. Firstly, it uses chaotic map to enhance the randomness and uniformity of the initial distribution of pollen population. Then, global average pollen position and dynamic weight reduction factor are introduced to achieve the update of individual pollen location in the process of global pollination, which can guide algorithm to correct search direction and avoid premature convergence. Finally, Cauchy mutation is used to increase the population diversity and help the algorithm to jump out of the local optimum. The simulation experiments on six classical test functions show that compared with FPA, DCFPA algorithm has better global optimization ability, and improves the convergence speed and solution accuracy of the algorithm and also has better optimization performance than those improved algorithm in related literatures.关键词
花授粉算法/混沌映射/动态全局搜索/Cauchy变异Key words
flower pollination algorithm/chaotic map/dynamic global search/Cauchy mutation分类
信息技术与安全科学引用本文复制引用
贺智明,李文静..基于动态全局搜索和柯西变异的花授粉算法[J].计算机工程与应用,2019,55(19):74-80,222,8.基金项目
国家自然科学基金(No.61562038,No.61462034) （No.61562038,No.61462034）
江西省教育厅科学技术研究项目(No.GJJ170517) （No.GJJ170517）
江西省研究生创新专项资金(No.YC2017-S314). （No.YC2017-S314）
