Journal of Frontiers of Computer Science and Technology ›› 2020, Vol. 14 ›› Issue (7): 1114-1125.DOI: 10.3778/j.issn.1673-9418.1905088

Previous Articles     Next Articles

Deep Evolution Algorithm Under Competitive and Cooperative Behavior

CHEN Haijuan, FENG Xiang, YU Huiqun   

  1. 1.School of Information Science and Engineering, East China University of Science and Technology, Shanghai 200237, China
    2.Shanghai Engineering Research Center of Smart Energy, Shanghai 200237, China
  • Online:2020-07-01 Published:2020-08-12

竞争合作行为下的深度演化算法

陈海娟冯翔虞慧群   

  1. 1.华东理工大学 信息科学与工程学院,上海 200237
    2.上海智慧能源工程技术研究中心,上海 200237

Abstract:

Combining depth with evolutionary algorithms, a deep evolutionary algorithm, the group competition cooperation optimization (GCCO) algorithm, is proposed. Firstly, the bio-group model is introduced to simulate the natural phenomenon that groups search prey. The algorithm can easily solve the optimization problem through multi-step iteration. In bio-group model, the follower adopts a variable step size region replication method to balance the convergence speed and optimization precision. The wanderer adopts random walk mode based on feature transfor-mation to avoid local optimization. Secondly, the introduction of competition model and cooperation model increases the complexity of the algorithm, and improves the search performance of the algorithm through competition and information sharing among groups. In addition, the mathematical model of the algorithm is derived from group theory, dynamics and imperial competition theory. The convergence of the algorithm is also verified theoretically. Finally, the performance of the proposed algorithm is tested through comparing it with the other three optimization algorithms on ten optimization benchmark functions. At the same time, GCCO achieves better results than other algorithms in setting up gas stations in Shanghai to improve the on-time rate.

Key words: deep evolution, feature transformation, competition model, cooperation model

摘要:

将深度与演化算法结合,提出一种深度演化算法,即群竞争合作优化(GCCO)算法。首先引入生物群模型来模拟群体搜索猎物的自然现象,算法通过多步迭代可简单实现优化问题求解。在生物群模型中,跟随者采用变步长的区域复制方式,平衡了收敛速度与优化精度,随机者采用基于特征变换的随机游走模式,避免陷入局部最优。其次引入竞争模型和合作模型增加算法复杂性,通过群体间的竞争和信息共享,提高算法的搜索性能。算法的数学模型是从群论、动力学以及帝国竞争理论推导出来的,在理论上也分析验证了算法的收敛性。最后在十个优化基准函数上与其他三种优化算法对比测试算法的性能。在解决上海市设立燃气站点提高到场及时率的实际问题中,GCCO算法也取得了比其他算法更好的效果。

关键词: 深度演化, 特征变换, 竞争模型, 合作模型