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

抗体修正免疫算法对高维0/1背包问题的应用 *
引用本文:庄中文,钱淑渠.抗体修正免疫算法对高维0/1背包问题的应用 *[J].计算机应用研究,2009,26(8):2921-2923.
作者姓名:庄中文  钱淑渠
作者单位:安顺学院,数学与计算机科学系,贵州安顺,561000
基金项目:安顺学院青年一般项目基金资助(20080514)
摘    要:遗传算法极难处理高维约束优化问题, 故借鉴免疫系统机理, 提出一种抗体修正免疫算法解决一类高 维约束优化问题。该算法设计的关键在于抗体亲和力由抗体浓度及群体状态决定; 可行抗体被克隆、突变; 非 可行抗体的基因按价值密度由小到大逐一修正。选取两种已有的智能算法(ETGA、ISGA), 通过不同约束条件 下的高维0/1背包问题的仿真比较。结果表明,该算法较其他算法能更快地跟踪最优值, 具有较强的勘测和开 采能力。

关 键 词:高维0/1背包问题    约束优化    抗体修正    免疫算法

Immune algorithm with antibody-repaired and its application for high-dimensional 0/1 knapsack problem
ZHUANG Zhong-wen,QIAN Shu-qu.Immune algorithm with antibody-repaired and its application for high-dimensional 0/1 knapsack problem[J].Application Research of Computers,2009,26(8):2921-2923.
Authors:ZHUANG Zhong-wen  QIAN Shu-qu
Institution:Dept.of Mathematics & Computer Science;Anshun College;Anshun Guizhou 561000;China
Abstract:It's difficulty to deal with high-dimensional optimization problem constrained for GA,this paper proposed an immune algorithm with antibody-repaired,based on biological immune system's functions,to solve a class of high-dimensional optimization problem constrained.The key of algorithm is: the affinity of antibodies had relation to the antibody's density and current population,the feasible antibodies were cloned and mutated,repaired the infeasible antibodies by means of the increasing sorting of price consis...
Keywords:high-dimensional 0/1 knapsack problem  constrained optimization  antibody repair  immune algorithms
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《计算机应用研究》浏览原始摘要信息
点击此处可从《计算机应用研究》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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