###
DOI:
工程科学与技术:2010,42(3):127-131
←前一篇   |   后一篇→
本文二维码信息
码上扫一扫!
求解TSP问题的抗体克隆优化算法
(1.海南师范大学 信息学院;2.四川大学计算机学院;3.海南师范大学信息学院)
A Novel Antibody Clone Optimization Algorithm for TSP
摘要
图/表
参考文献
相似文献
本文已被:浏览 2557次   下载 0
投稿时间:2009-04-29    修订日期:2009-12-30
中文摘要: 为解决传统求解TSP问题(Traveling Salesman Problem)的方法所固有的组合爆炸问题,提出了一种新的基于MHC(Major Histocompatibility Complex,主要组织相容性复合体)的抗体克隆优化算法(Antibody Clone Optimization Algorithm inspired by MHC,COAMHC)。该算法应用MHC分子单倍型特性将优秀抗体基因保存为MHC串,并通过疫苗接种遗传至子代以增强其局部搜索能力;应用MHC分子多态性并通过基因突变以及随机引入新抗体基因来提高抗体群多样性,以增强其全局搜索能力。通过TSP问题的仿真实验表明,该算法在收敛速度、和求解精度方面比经典克隆选择算法CLONALG性能更好
中文关键词: 人工免疫系统  TSP  MHC  抗体克隆算法  优化
Abstract:To address the traditional Traveling Salesman Problems (TSP) with the combinatorial explosion property, a novel MHC-inspired antibody clone optimization algorithm (COAMHC) was proposed by drawing inspiration from the features of Major Histocompatibility Complex (MHC) in the biological immune system. COAMHC preserves elitist antibody genes through the MHC string to improve its local search capability and improves the diversity of antibody population by gene mutation and some new random immigrant antibodies to enhance its global search capability. The experiments of comparing COAMHC with the canonical clone selection algorithm (CLONALG) were carried out for the TSP and results indicated that the performance of COAMHC is better than that of CLONALG. The COAMHC algorithm provides new opportunities for solving previously intractable optimization problems such as TSP.
文章编号:200900414     中图分类号:    文献标志码:
基金项目:国家自然科学基金资助项目(60573130;60873246);国家863计划资助项目(2006AA01Z435);教育部博士点基金资助项目(20070610032);海南师范大学引进博士科研启动项目(00203020214)
作者简介:
引用文本:
张瑜,李涛,吴丽华,夏峰.求解TSP问题的抗体克隆优化算法[J].工程科学与技术,2010,42(3):127-131.
Zhang Yu,Li Tao,Wu Lihua,Xia Feng.A Novel Antibody Clone Optimization Algorithm for TSP[J].Advanced Engineering Sciences,2010,42(3):127-131.