首页 | 本学科首页   官方微博 | 高级检索  
     

一种基于免疫原理求解TSP问题的模型
引用本文:蒋亚平,李涛,梁刚,徐春林,黄雪梅,王铁方.一种基于免疫原理求解TSP问题的模型[J].计算机工程,2006,32(15):165-167.
作者姓名:蒋亚平  李涛  梁刚  徐春林  黄雪梅  王铁方
作者单位:1. 四川大学计算机学院,成都,610065;河南教育学院信息技术系,郑州,450003
2. 四川大学计算机学院,成都,610065
基金项目:中国科学院资助项目;高等学校博士学科点专项科研项目
摘    要:基于人工免疫原理,建立了一个基于免疫机制求解TSP问题的数学模型。在该模型中,定义了TSP问题中的抗原和抗体,描述了记忆细胞动态进化过程,并借鉴遗传算法中基因变异思想,提出了优势基因进化的GFE算法,结合生物免疫系统抗体浓度稳定原理,在克隆选择过程中实现了抗体集合的进化计算,快速有效地求解出问题的全局近似最优解。实验结果表明该算法对解决组合优化问题不仅可行,而且有较快的收敛速度和较强的全局搜索能力。

关 键 词:人工免疫  克隆选择  浓度  货郎担问题
文章编号:1000-3428(2006)15-0165-03
收稿时间:08 21 2005 12:00AM
修稿时间:2005-08-21

An Immune-based Model for Solving TSP
JIANG Yaping,LI Tao,LIANG Gang,XU Chunlin,HUANG Xuemei,WANG Tiefang.An Immune-based Model for Solving TSP[J].Computer Engineering,2006,32(15):165-167.
Authors:JIANG Yaping  LI Tao  LIANG Gang  XU Chunlin  HUANG Xuemei  WANG Tiefang
Affiliation:1. Dept. of Computer, Sichuan University, Chengdu 610065; 2. Dept. of Information Technology, Henan Institute of Education, Zhengzhou 450003
Abstract:A mathematical model of TSP problem based on artificial immune system is established. In this model, antibody, antigen, and describe dynamic process of memory cells to the problem are defined. This paper refers to the conception of variation GA, and presents GFE algorithm of evolution of superior genes, and makes use of the principle of immune stability in the clone’s procedure to evolve the set of antibody in order to get the global approximate solution rapidly and efficiently. The result of the experiment has proved that the algorithm is not only feasible, but also a comparative good method which has a fast convergence speed and global optimization to solve the NP problems.
Keywords:Artificial immune  Clone selection  Concentration  Traveling salesman problem
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机工程》浏览原始摘要信息
点击此处可从《计算机工程》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号