计算机应用 ›› 2021, Vol. 41 ›› Issue (5): 1412-1418.DOI: 10.11772/j.issn.1001-9081.2020081200

所属专题: 先进计算

• 先进计算 • 上一篇    下一篇

针对混合变量优化问题的协同进化蚁群优化算法

韦铭燕, 陈彧, 张亮   

  1. 武汉理工大学 理学院, 武汉 430070
  • 收稿日期:2020-08-10 修回日期:2020-09-23 出版日期:2021-05-10 发布日期:2020-11-05
  • 通讯作者: 陈彧
  • 作者简介:韦铭燕(1997-),女,安徽安庆人,硕士研究生,主要研究方向:智能计算;陈彧(1981-),男,四川广安人,副教授,博士,CCF会员,主要研究方向:进化计算、生物信息学;张亮(1977-),男,湖北随州人,教授,博士,主要研究方向:优化理论、控制理论。
  • 基金资助:
    国家自然科学基金面上项目(61573012);中央高校基本科研业务费专项(2020IB006)。

Coevolutionary ant colony optimization algorithm for mixed-variable optimization problem

WEI Mingyan, CHEN Yu, ZHANG Liang   

  1. School of Science, Wuhan University of Technology, Wuhan Hubei 430070, China
  • Received:2020-08-10 Revised:2020-09-23 Online:2021-05-10 Published:2020-11-05
  • Supported by:
    This work is partially supported by the General Program of National Natural Science Foundation of China (61573012), the Fundamental Research Funds for the Central Universities (2020IB006).

摘要: 针对由连续变量和分类变量构成的混合变量优化问题(MVOP),采用协同进化策略来对混合变量决策空间进行搜索,提出了一种协同进化蚁群优化算法(CACOAMV)。CACOAMV分别采用连续和离散蚁群优化(ACO)策略生成连续和分类变量子种群,通过合作者来对连续和分类变量子向量进行评价,分别对连续和分类变量子种群进行更新来实现对混合变量决策空间的高效协同搜索。进一步地,利用信息素平滑机制增强对分类变量解空间的全局探索能力,并设计了一种面向协同进化框架的“最佳+随机合作者”的重启策略来提高协同搜索效率。与混合变量的蚁群(ACOMV)算法和种群规模线性变小的差分进化-蚁群混合变量优化算法(L-SHADEACO)的比较表明,CACOAMV能够进行更有效的局部开发,从而提高最终结果在目标空间中的近似精度;与基于集合的混合变量差分进化算法(DEMV)相比较,CACOAMV能够在决策空间中更好地逼近全局最优解,具有更好的全局探索能力。综上,采用协同进化机制的CACOAMV能有效保持全局探索和局部开发的平衡,从而具有更好的寻优性能。

关键词: 混合变量优化问题, 协同进化, 分类变量, 蚁群优化, 随机启发式算法

Abstract: For Mixed-Variable Optimization Problem (MVOP) containing both continuous and categorical variables, a coevolution strategy was proposed to search the mixed-variable decision space, and a Coevolutionary Ant Colony Optimization Algorithm for MVOP (CACOAMV) was developed. In CACOAMV, the continuous and categorical sub-populations were generated by using the continuous and discrete Ant Colony Optimization (ACO) strategies respectively, the sub-vectors of continuous and categorical variables were evaluated with the help of cooperators, and the continuous and categorical sub-populations were respectively updated to realize the efficient coevolutionary search in the mixed-variable decision space. Furthermore, the ability of global exploration to the categorical variable solution space was improved by introducing a smoothing mechanism of pheromone, and a "best+random cooperators" restart strategy facing the coevolution framework was proposed to enhance the efficiency of coevolutionary search. By comparing with the Mixed-Variable Ant Colony Optimization (ACOMV) algorithm and the Success History-based Adaptive Differential Evolution algorithm with linear population size reduction and Ant Colony Optimization (L-SHADEACO), it is demonstrated that CACOAMV is able to perform better local exploitation, so as to improve approximation quality of the final results in the target space; the comparison with the set-based Differential Evolution algorithm with Mixed-Variables (DEMV) shows that CACOAMV is able to better approximate the global optimal solutions in the decision space and has better global exploration ability. In conclusion, CACOAMV with the coevolutionary strategy can keep a balance between global exploration and local exploitation, which results in better optimization ability.

Key words: Mixed-Variable Optimization Problem (MVOP), coevolution, categorical variable, Ant Colony Optimization (ACO), Random Heuristics Algorithm (RHA)

中图分类号: