计算机工程2011，Vol.37Issue(15)：161-163,3.DOI:10.3969/j.issn.1000-3428.2011.15.051
一种新的动态自适应克隆选择并行算法
Dynamic Adaptive Clone Selection Parallel Algorithm
摘要
Abstract
A new dynamic adaptive clone selection algorithm is proposed. Mutation probability of each antibody is dynamically calculated. According to antibody affinity, antibody populations are dynamically divided into memory antibody units and general antibody units. Subsequently, antibody populations are adjusted by sphere crossover, so that global search speed of the proposed algorithm is accelerated. Meanwhile, according to larger calculation and longer consumed time, parallel computation technology is introduced into the provided algorithm. The effectiveness and the feasibility of the proposed algorithm are verified by examples. Example shows that the proposed algorithm has less time-consuming and higher convergence precision.关键词
克隆选择/变异概率/抗体亲和度/球面杂交/并行计算Key words
clone selection/mutation probability/antibody affinity/sphere crossover/parallel computation分类
信息技术与安全科学引用本文复制引用
李红婵,朱颢东..一种新的动态自适应克隆选择并行算法[J].计算机工程,2011,37(15):161-163,3.基金项目
河南省基础与前沿技术研究计划基金资助项目(102300410266) （102300410266）
