计算机工程与科学2018，Vol.40Issue(5)：906-915,10.DOI:10.3969/j.issn.1007-130X.2018.05.020
基于SQP局部搜索的多子群果蝇优化算法
A multiple subgroups fruit fly optimization algorithm based on sequential quadratic programming local search
摘要
Abstract
The Fruit fly Optimization Algorithm (FOA) is easy to fall into premature convergence due to the decrease of population diversity in the process of optimization.In order to overcome the problem,a multiple subgroups fruit fly optimization algorithm based on sequential quadratic programming local search (MFOA-SQP) is proposed.The fruit flies are assigned to multiple subgroups and the mutual learning between subgroups adjusts the step by introducing the inertia weight and learning factors in particle swarm optimization algorithm.The subgroups are reclassified every a certain number of iterations,which can improve population diversity and avoid premature convergence.The best individual is searched by SQP to improve the local fruit fly depth search capability,improving the stability and accelerating the evolution of population in the late iterations.Experiments on 6 benchmark test functions are carried out and an application case that classifies banking customers by the optimized generalized regression neural network is adopted.The results show that the proposed algorithm has superior performance in terms of optimization accuracy and speed,and can effectively improve the classification accuracy of generalized regression neural networks.关键词
果蝇优化算法/序列二次规划/多子群/协同进化/早熟收敛Key words
fruit fly optimization algorithm/sequential quadratic programming/multiple subgroups/co-evolution/premature convergence分类
信息技术与安全科学引用本文复制引用
王英博,王艺星..基于SQP局部搜索的多子群果蝇优化算法[J].计算机工程与科学,2018,40(5):906-915,10.基金项目
国家自然科学基金(61401185) （61401185）
