首页> 外文期刊>IEICE Transactions on Information and Systems >Quantum Interference Crossover-based Clonal Selection Algorithm And Its Application To Traveling Salesman Problem
【24h】

Quantum Interference Crossover-based Clonal Selection Algorithm And Its Application To Traveling Salesman Problem

机译:基于量子干扰交叉的克隆选择算法及其在旅行商问题中的应用

获取原文
获取原文并翻译 | 示例
       

摘要

Clonal Selection Algorithm (CSA). based on the clonal selection theory proposed by Burnet, has gained much attention and wide applications during the last decade. However, the proliferation process in the case of immune cells is asexual. That is, there is no information exchange during different immune cells. As a result the traditional CSA is often not satisfactory and is easy to be trapped in local optima so as to be premature convergence. To solve such a problem, inspired by the quantum interference mechanics, an improved quantum crossover operator is introduced and embedded in the traditional CSA. Simulation results based on the traveling salesman problems (TSP) have demonstrated the effectiveness of the quantum crossover-based Clonal Selection Algorithm.
机译:克隆选择算法(CSA)。在Burnet提出的克隆选择理论的基础上,近十年来受到了广泛的关注和广泛的应用。但是,免疫细胞的增殖过程是无性的。也就是说,在不同的免疫细胞之间没有信息交换。结果,传统的CSA经常不能令人满意,并且容易陷入局部最优中,从而过早收敛。为了解决这个问题,受量子干涉机制的启发,引入了一种改进的量子交叉算子并将其嵌入传统的CSA中。基于旅行商问题(TSP)的仿真结果证明了基于量子交叉的克隆选择算法的有效性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号