计算机应用 ›› 2017, Vol. 37 ›› Issue (11): 3219-3225.DOI: 10.11772/j.issn.1001-9081.2017.11.3219

• 2017年中国计算机学会人工智能会议(CCFAI 2017) • 上一篇    下一篇

求解大规模优化问题的新型协同差分进化算法

董小刚1, 邓长寿1, 谭毓澄2, 彭虎1, 吴志健3   

  1. 1. 九江学院 信息科学与技术学院, 江西 九江 332005;
    2. 九江学院 理学院, 江西 九江 332005;
    3. 软件工程国家重点实验室(武汉大学), 武汉 430072
  • 收稿日期:2017-05-11 修回日期:2017-06-07 出版日期:2017-11-10 发布日期:2017-11-11
  • 通讯作者: 邓长寿
  • 作者简介:董小刚(1979-),男,陕西宝鸡人,讲师,硕士,CCF会员,主要研究方向:智能计算;邓长寿(1972-),男,安徽合肥人,教授,博士,CCF会员,主要研究方向:智能计算、大数据;谭毓澄(1964-),男,江西九江人,副教授,硕士,主要研究方向:应用数学、智能计算;彭虎(1981-),男,湖南长沙人,副教授,博士,CCF会员,主要研究方法:智能计算、大数据;吴志健(1963-),男,江西上饶人,教授,博士、CCF会员,主要研究方向:智能计算、并行计算、智能信息处理。
  • 基金资助:
    国家自然科学基金资助项目(61364025);江西省教育厅科技项目(GJJ161072,GJJ161076)。

Cooperative differential evolution algorithm for large-scale optimization problems

DONG Xiaogang1, DENG Changshou1, TAN Yucheng2, PENG Hu1, WU Zhijian3   

  1. 1. School of Computer Science and Technology, Jiujiang University, Jiujiang Jiangxi 332005, China;
    2. College of Science, Jiujiang University, Jiujian Jiangxi 332005, China;
    3. State Key Laboratory of Software Engineering(Wuhan University), Wuhan Hubei 430072, China
  • Received:2017-05-11 Revised:2017-06-07 Online:2017-11-10 Published:2017-11-11
  • Supported by:
    This work is partially supported by the National Natural Science Foundation of China (61364025), the Science and Technology Project of Jiangxi Provincial Education Department (GJJ161072,GJJ161076).

摘要: 基于分而治之的策略,研究求解大规模优化问题的新方法。首先,基于加性可分性原理提出一种改进的变量分组方法,该方法以随机取点的方式,成对检测所有变量之间的相关性;同时,充分利用相关性学习的信息,对可分变量组进行再次降维;其次,引入改进的差分进化算法作为新型子问题优化器,增强了子空间的寻优性能;最后,将两项改进引入到协同进化框架构建DECC-NDG-CUDE算法。在10个选定的大规模优化问题上进行分组和优化两组仿真实验,分组实验结果表明新的分组方法能有效识别变量的相关性,是有效的变量分组方法;优化实验表明,DECC-NDG-CUDE算法对10个问题的求解相对于两种知名算法DECC-DG、DECCG在性能上具备整体优势。

关键词: 大规模优化, 变量分组, 加性可分, 优化器, 协同进化

Abstract: A new method of large-scale optimization based on divide-and-conquer strategy was proposed. Firstly, based on the principle of additive separability, an improved variable grouping method was proposed. The randomly accessing point method was used to check the correlation between all variables in pairs. At the same time, by making full use of the interdependency information of learning, the large groups of separable variables were re-grouped. Secondly, a new subcomponent optimizer was designed based on an improved differential evolution algorithm to enhance the subspace optimization performance. Finally, this two kinds of improvements were introduced to co-evolutionary framework to construct a DECC-NDG-CUDE (Cooperative differential evolution with New Different Grouping and enhancing Differential Evolution with Commensal learning and Uniform local search) algorithm. Two experiments of grouping and optimization were made on 10 large-scale optimization problems. The experimental results show the interdependency between variables can be effectively identified by the new method of grouping, and the performance of DECC-NDG-CUDE is better than two state-of-the-art algorithms DECC-D (Differential Evolution with Cooperative Co-evolution and differential Grouping) and DECCG (Differential Evolution with Cooperative Co-evolution and Random Grouping).

Key words: large-scale optimization, variable grouping, additive separability, optimizer, cooperative co-evolution

中图分类号: