基于SQP局部搜索的多子群果蝇优化算法

计算机工程与科学

基于SQP局部搜索的多子群果蝇优化算法

王英博1，王艺星2

（1.辽宁工程技术大学创新实践学院,辽宁阜新 123000;2.辽宁工程技术大学软件学院,辽宁葫芦岛 125105）

收稿日期:2016-11-02 修回日期:2017-02-15 出版日期:2018-05-25 发布日期:2018-05-25
基金资助:
国家自然科学基金（61401185）

A multiple subgroups fruit fly optimization algorithm based

on sequential quadratic programming local search

#br#

WANG Ying-bo1，WANG Yi-xing2

（1.School of Innovation and Practice,Liaoning Technical University,Fuxin 123000;

2.School of Software,Liaoning Technical University,Huludao 125105,China）

Received:2016-11-02 Revised:2017-02-15 Online:2018-05-25 Published:2018-05-25

摘要/Abstract

摘要：

针对基本果蝇优化算法在寻优过程中种群多样性降低导致算法易陷入早熟收敛的问题，提出了基于序列二次规划（SQP）局部搜索的多子群果蝇优化算法（MFOA-SQP）。新算法将果蝇种群均匀划分为多个子群，并引入粒子群算法中的惯性权重和学习因子，协同调节果蝇移动方向和步长；每隔一定迭代次数重新划分子群，避免种群单一化，使算法更易跳出局部最优；对子群最优个体进行SQP搜索，提高局部寻优性能。通过6个测试函数和优化广义回归神经网络对银行客户进行分类的实验结果表明，算法在寻优精度和速度方面性能优越，能够有效提高广义回归神经网络的分类准确率。

关键词: 果蝇优化算法, 序列二次规划, 多子群, 协同进化, 早熟收敛

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

王英博1，王艺星2. 基于SQP局部搜索的多子群果蝇优化算法[J]. 计算机工程与科学.

WANG Ying-bo1，WANG Yi-xing2.

A multiple subgroups fruit fly optimization algorithm based

on sequential quadratic programming local search

#br#

[J]. Computer Engineering & Science.

[1]	申晓宁, 游璇, 陈庆洲, 潘红丽, 黄遥. 采用双档案协同进化离散多目标烟花算法的低碳疫苗冷链优化配送[J]. 计算机工程与科学, 2022, 44(12): 2255-2265.
[2]	袁培燕, 耿丽娟, 张豪. 物联网感知数据边缘卸载机制研究[J]. 计算机工程与科学, 2021, 43(03): 435-441.
[3]	张铸, 饶盛华, 张仕杰. 一种新型的混沌步长果蝇优化算法[J]. 计算机工程与科学, 2020, 42(04): 755-760.
[4]	陈明扬，王林，余晓晓. 改进果蝇算法优化回声状态网络的旅游需求预测研究[J]. 计算机工程与科学, 2020, 42(02): 307-316.
[5]	马永杰，朱琳，田福泽. 基于精英种群策略的协同差分进化算法[J]. 计算机工程与科学, 2019, 41(02): 335-.
[6]	戴月明，张明明，王艳. 协同进化混合蛙跳算法[J]. 计算机工程与科学, 2018, 40(01): 139-147.
[7]	张磊1,刘成忠2. 一种面向多模函数改进的果蝇优化算法[J]. 计算机工程与科学, 2017, 39(01): 206-214.
[8]	王超学,吴书玲,张婧菁. 双系统协同进化的基因表达式编程及其在函数发现中的应用[J]. 计算机工程与科学, 2016, 38(11): 2314-2320.
[9]	程子安,童鹰,申丽娟,于帅帅,李明. 一种动态双种群果蝇优化算法求解FJSP[J]. 计算机工程与科学, 2016, 38(09): 1901-1908.
[10]	高雷阜，赵世杰，于冬梅，徒君. 果蝇耦合均匀设计算法及其优化SVM参数[J]. J4, 2016, 38(05): 954-959.
[11]	胡颖，庄雷. 改进的粒子群算法在虚拟网映射中的应用[J]. J4, 2014, 36(11): 2169-2173.
[12]	吴斯曹炬. 带记忆信息的协同进化算法[J]. J4, 2008, 30(3): 78-81.