摘要
DE Castro提出的克隆选择算法(CSA)中,抗体的多样性主要通过高频变异来实现,而实际生物免疫系统中还有一个重要的操作是受体编辑.受此启发,提出了带受体编辑的改进克隆选择算法.该算法利用未成熟优良子群体提供的优良基因片断,根据路径代价最小化和延时要求对抗体进行两次受体编辑.这样,在无需求解备选路径集的情况下,直接运用该改进算法可快速寻到最优解.在时延受限组播路由的仿真实验中表明:该算法比一般CSA算法和遗传(GA)算法的搜索效率更高,算法复杂度更低.
Antibodies are diversified basically by hypermutation in the clonal selection algorithm(CSA) proposed by de Castro.However,there is another important mechanism,namely,receptor editing in immune system.Inspired by the mechanism,an improved clonal selection algorithm with receptor editing is proposed,which adopted the good gene segment in the immaturity subpopulation to realize two receptor editing based on the principle of minimum cost and delay constrain.Thus,search for optimum solution can be achieved promptly by direct application of the improved algorithm without prepared routing set.The results of simulation tests of multicast routing with delay constrain indicated higher searching efficiency and lower computational complexity compared with the usual CSA and GA.
出处
《电子学报》
EI
CAS
CSCD
北大核心
2010年第1期37-41,共5页
Acta Electronica Sinica
基金
国家自然科学基金重点项目(No.60634020)
湖南省自然科学基金重点项目(No.07JJ3126)
湖南省科技计划(No.2009GK3082)
关键词
受体编辑
改进克隆选择算法
组播路由
时延受限
receptor editing the improved clonal selection algorithm multicast routing delay constrain