本文已被:浏览 2084次 下载 2次
投稿时间:2009-11-13 修订日期:2010-01-13
投稿时间:2009-11-13 修订日期:2010-01-13
中文摘要: 为了解决传统蚁群算法搜索速度慢、容易出现早熟、停滞的缺点,以及传统免疫算法由于反馈信息利用不足存在大量无为的冗余迭代导致求解效率低的缺点,提出了一种蚁群与免疫克隆相结合的混合算法,该算法在前期采用免疫算法来产生蚁群算法的初始信息分布,在后期根据路径浓度抑制机制调整路径上的信息量,从而保持了蚁群多样性,并将该算法用于求解旅行商问题进行计算机仿真,从实验结果可以看出,该算法具有针对性的改进,是一种收敛速度和寻优能力都较好的优化方法。
Abstract:In order to solve the problems caused by the traditional ant colony algorithm, such as searching slowly, cling to prematurity, standstill, and the inefficient and useless redundant iteration caused by feedback underutilized in traditional immune algorithm,an algorithm combined ant colony algorithm and Immune Clone hybrid algorithm was proposed. With this algorithm, initial information distribution of ant colony algorithm was generated by immune algorithm in the early work, and the information on the path was adjusted by path concentration of inhibition mechanism at latter work, which kept diversity of ant colony. The algorithm was used to solve the traveling salesman problem for computer simulation.The experimental results showed that the algorithm has targeted improvements, good convergence speed and optimization capabilities.
keywords: artificial immunity ant colony algorithm TSP
文章编号:200901023 中图分类号: 文献标志码:
基金项目:国家863计划基金资助项目(2008AAO1Z402);四川省技术创新基金资助项目(2008PT013)
作者简介:
引用文本:
刘勇,刘念,刘孙俊.一种基于免疫蚁群混合算法的TSP求解模型[J].工程科学与技术,2010,42(3):121-126.
Liu Yong,Liu Nian,Liu Sunjun.A TSP Solving Model Based on Immune Ant Colony Hybrid Algorithm[J].Advanced Engineering Sciences,2010,42(3):121-126.
引用文本:
刘勇,刘念,刘孙俊.一种基于免疫蚁群混合算法的TSP求解模型[J].工程科学与技术,2010,42(3):121-126.
Liu Yong,Liu Nian,Liu Sunjun.A TSP Solving Model Based on Immune Ant Colony Hybrid Algorithm[J].Advanced Engineering Sciences,2010,42(3):121-126.