检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]湖南大学电气与信息工程学院,湖南长沙410082 [2]中南大学信息科学与工程学院,湖南长沙410082
出 处:《系统仿真学报》2008年第6期1536-1540,共5页Journal of System Simulation
基 金:国家自然科学基金重点项目(60634020);教育部博士点基金项目(20060532026)
摘 要:通过在克隆选择过程中引入聚类竞争机制,提出了一种免疫聚类竞争的克隆选择算法。采用了抗体聚类、竞争扩增、克隆删除、体细胞高频变异、抗体循环补充等思想及相关算子操作,增强聚类族中的优秀个体获得克隆扩增实现亲和力成熟的机会,提高抗体群分布的多样性,在深度搜索和广度寻优之间取得了平衡。实验仿真及应用结果表明:该算法具有可靠的全局收敛性及较快的收敛速度,将其应用于冶金过程目标优化中取得较好的效果。By introducing a mechanism of Cluster and Competition in the clonal selection process, a novel immune Cluster and Competition Clonal Selection Algorithm (3CSA ) was proposed. To quickly obtain the global optimum and local optimum, this algorithm adopted the ideas of antibody cluster, compete expansion, clonal elimination, antibody hyper mutation and supplement. Through those operators, the variety of antibody and affinity maturation was enhanced. Simulation illustrated that the algorithm has a remarkable quality of the global convergence reliability and convergence velocity. The method was applied to metallurgical process objective optimization and the satisfactory results were obtained.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.28