首页> 外文期刊>Symmetry >Study on an Adaptive Co-Evolutionary ACO Algorithm for Complex Optimization Problems
【24h】

Study on an Adaptive Co-Evolutionary ACO Algorithm for Complex Optimization Problems

机译:复杂优化问题的自适应协同进化ACO算法研究

获取原文
           

摘要

The ant colony optimization (ACO) algorithm has the characteristics of positive feedback, essential parallelism, and global convergence, but it has the shortcomings of premature convergence and slow convergence speed. The co-evolutionary algorithm (CEA) emphasizes the existing interaction among different sub-populations, but it is overly formal, and does not form a very strict and unified definition. Therefore, a new adaptive co-evolutionary ant colony optimization (SCEACO) algorithm based on the complementary advantages and hybrid mechanism is proposed in this paper. Firstly, the pheromone update formula is improved and the pheromone range of the ACO algorithm is limited in order to achieve the adaptive update of the pheromone. The elitist strategy and co-evolutionary idea are used for reference, the symbiotic mechanism and hybrid mechanism are introduced to better utilize the advantages of the CEA and ACO. Then the multi-objective optimization problem is divided into several sub-problems, each sub-problem corresponds to one population. Each ant colony is divided into multiple sub-populations in a common search space, and each sub-population performs the search activity and pheromone updating strategy. The elitist strategy is used to retain the elitist individuals within the population and the min-max ant strategy is used to set pheromone concentration for each path. Next, the selection, crossover, and mutation operations of individuals are introduced to adaptively adjust the parameters and implement the information sharing of the population and the co-evolution. Finally, the gate assignment problem of a hub airport is selected to verify the optimization performance of the SCEACO algorithm. The experiment results show that the SCEACO algorithm can effectively solve the gate assignment problem of a hub airport and obtain the effective assignment result. The SCEACO algorithm improves the convergence speed, and enhances the local search ability and global search capability.
机译:蚁群优化算法具有正反馈,本质并行,全局收敛的特点,但存在收敛过早,收敛速度慢的缺点。协同进化算法(CEA)强调了不同子种群之间现有的相互作用,但是它过于形式化,并且没有形成非常严格和统一的定义。因此,本文提出了一种基于互补优势和混合机制的自适应协同进化蚁群算法(SCEACO)。首先,改进了信息素更新公式,并限制了ACO算法的信息素范围,以实现信息素的自适应更新。借鉴精英策略和共同进化思想,引入共生机制和混合机制,更好地利用了CEA和ACO的优势。然后将多目标优化问题分为几个子问题,每个子问题对应一个总体。每个蚁群在一个公共搜索空间中分为多个子种群,每个子种群执行搜索活动和信息素更新策略。精英策略用于将精英分子保留在人群中,而最小-最大蚂蚁策略用于设置每种路径的信息素浓度。接下来,引入个体的选择,交叉和变异操作,以自适应地调整参数并实现种群的信息共享和共同进化。最后,选择枢纽机场的登机口分配问题,以验证SCEACO算法的优化性能。实验结果表明,SCEACO算法可以有效解决枢纽机场的登机口分配问题,并获得有效的分配结果。 SCEACO算法提高了收敛速度,增强了局部搜索能力和全局搜索能力。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号