计算机科学 ›› 2010, Vol. 37 ›› Issue (6): 256-260.

• 人工智能 • 上一篇    下一篇

一种求解TSP问题的分层免疫算法

吴建辉,章兢,张小刚,刘朝华   

  1. (湖南大学电气与信息工程学院 长沙410082);(湖南大学计算机与通信学院 长沙410082)
  • 出版日期:2018-12-01 发布日期:2018-12-01
  • 基金资助:
    本文受国家自然科学基金重点项目((60634020),国家自然科学基金项目(60874096)资助.

Novel Hierarchical Immune Algorithm for TSP Solution

WU Jian-hui,ZHANG Jing,ZHANG Xiao-gang,LIU Zhao-hua   

  • Online:2018-12-01 Published:2018-12-01

摘要: 摘要为提高人工免疫算法求解旅行商问题的效率,构造了一种基于多子种群免疫进化的两层框架模型。在此模型的基础上提出了分层局部最优免疫优势克隆选择算法(HLOICSA)。通过对多个子种群进行低层免疫操作—局部最优免疫优势、克隆选择、基于信息嫡的杭体多样性改善和高层遗传操作—选择、交又、变异,增强优秀杭体实现亲和力成熟的机会,提高抗体群分布的多样性,在深度搜索和广度寻优之间取得了平衡。针对TSP的实验结果表明,该算法具有可靠的全局收敛性及较快的收敛速度。

关键词: 人工免疫算法,旅行商问题,分层,局部最优免疫优势,克隆选择

Abstract: In order to solve traveling salesman problem more efficiently using artificial immune algorithm, a two-floor model based on multiple sub-populations immune evolution as well as hierarchical local optimization immunodominance clonal selection algorithm(HLOICSA) was put forward. I}o quickly obtain the global optimum,multiple sulrpopulations were operated by bottom floor immune operators:local optimization immunodominance, clonal selection, antibody diversity amelioration based on locus information entropy, multiple sub-populations were also operated by top floor genetic operators; selection, crossover, mutation. I}hrough those operators, diversity of antibody sulrpopulation distribution and excellent antibody affinity maturation was enhanced, the balance between in the depth and breadth of the search-optimizing was acquired. Experimental results indicate that the algorithm has a remarkable quality of the global convergence reliability and convergence velocity.

Key words: Artificial immune algorithm, Traveling salesman problem, Hierarchical, Local optimization immunodomi nance, Clonal selection

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!