计算机科学 ›› 2014, Vol. 41 ›› Issue (6): 254-259.doi: 10.11896/j.issn.1002-137X.2014.06.050

• 人工智能 • 上一篇    下一篇

改进人工蜂群算法求解多目标连续优化问题

葛宇,梁静,王学平,谢小川   

  1. 四川师范大学基础教学学院 成都610068;成都工业学院网络中心 成都610031;四川师范大学数学与软件科学学院 成都610068;四川师范大学基础教学学院 成都610068
  • 出版日期:2018-11-14 发布日期:2018-11-14
  • 基金资助:
    本文受四川省教育厅项目:人工蜂群算法及其在多目标优化问题中的应用研究(12ZB112)资助

Improved Artificial Bee Colony Algorithms for Multi-objective Continuous Optimization Problem

GE Yu,LIANG Jing,WANG Xue-ping and XIE Xiao-chuan   

  • Online:2018-11-14 Published:2018-11-14

摘要: 针对多目标连续优化问题,依据人工蜂群算法原理给出其求解流程,并指出算法中更新策略存在盲目搜索和丢失优秀个体的不足,随后提出改进方案。改进方案包含两部分:首先,设计一种自适应搜索算子,使算法在运行过程中能根据个体质量自动调节搜索范围,让算法搜索行为准确高效;其次,利用外部集合记录下新产生的个体,一次迭代完成后结合外部集合重新构造种群,让算法能有效地保存进化过程中产生的优秀个体。实验中将改进人工蜂群算法与NSGA2算法、改进前算法以及文献报道的同类优秀算法进行了比较,结果说明:改进人工蜂群算法在求解多目标连续优化问题中具有良好的收敛性和均匀性。

关键词: 人工蜂群算法,多目标连续优化,更新策略,自适应搜索算子 中图法分类号TP18文献标识码A

Abstract: In order to solve multi-objective continuous optimization problem,this paper gave the solving process accor-ding to artificial bee colony algorithm theory,and pointed out that the updating strategy in the algorithm has defect of blind searching and missing good individuals,thus proposed an improved strategy.The improved strategy has two parts.First,a self-adapting searching operator is designed to enable the algorithm to adjust the searching range automa-tically according to individual quality during the iterative process,leading to a more accurate and efficient algorithm searching process.Second,the newly produced individuals are recorded by external archive,and external archive is combined to reconstruct the colony after a iteration,which can save good individuals in the iterative process.The experiment compares improved artificial bee colony algorithm with NSGA2algorithm,artificial bee colony algorithm and superior algorithm alike in papers.The comparison result indicates the improved artificial bee colony algorithm has good convergence and uniformity in solving multi-objective continuous optimization problem.

Key words: Artificial bee colony algorithm,Multi-objective continuous optimization problem,Updating strategy,Self-adapting searching operator

[1] 公茂果,焦李成,杨咚咚.进化多目标优化算法研究[J].软件学报,2009,20(2):271-289
[2] Ali M,Siarry P,Pant M.An efficient Differential Evolutionbased algorithm for solving multi-objective optimization problems[J].European Journal of Operational Research,2012,7:404-416
[3] 王瑞琪,张承慧,李珂.基于改进混沌优化的多目标遗传算法[J].控制与决策,2011,26(9):1391-1397
[4] 贾树晋,杜斌,岳恒.基于局部搜索与混合多样性策略的多目标粒子群算法[J].控制与决策,2012,7(6):813-818
[5] Karaboga D.An idea based on honey bee swarm for numerical optimization[R].Kayseri:Erciyes University,2005
[6] 周清雷,陈明昭,张兵.多目标人工蜂群算法在服务组合优化中的应用[J].计算机应用研究,2012,29(10):3625-3628 (下转第286页)(上接第259页)
[7] Wang L,Zhou G,Xu Y,et al.An enhanced Pareto-based artificial bee colony algorithm for the multi-objective flexible job-shop scheduling[J].The International Journal of Advanced Manufacturing Technology,2012,60(9-12):1111-1123
[8] Omkar S N,Senthilnath J,Khandelwal R.Artificial Bee Colony (ABC) for multi-objective design optimization of composite structures[J].Applied Soft Computing,2011,1:489-499
[9] Junqing L,Quanke P,Kaizhou G.Pareto-based discrete artificial bee colony algorithm for multi-objective flexible job shop sche-duling problems[J].Int J Adv Manuf Technol,2011,55:1159-1169
[10] 施展,陈庆伟.基于QPSO 和拥挤距离排序的多目标量子粒子群优化算法[J].控制与决策,2011,6(4):540-547
[11] 毕晓君,王艳娇.加速收敛的人工蜂群算法[J].系统工程与电子技术,2011,33(12):2756-2761
[12] Deb K,Pratap A,Agarwal S,et al.A fast and elitist multi-objective genetic algorithm:NSGA-II[J].IEEE Transaction on Evolutionary Computation,2002,6(2):182-197
[13] Akay B,Karaboga D.Parameter tuning for the artificial bee co-lony algorithm[C]∥International Conference on Computer and Computational Intelligence.2009:608-619
[14] 刘衍民,赵庆祯,牛奔.基于E占优的自适应多目标粒子群算法[J].控制与决策,2011,21(1):90-95
[15] Yen G G,Leong W F.Dynamic multiple swarms in multiobjective particle swarm optimization[J].IEEE Trans on Systems,Man and Cybernetics,Part A:Systems and Humans,2009,39(4):890-911

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!