计算机应用研究2009，Vol.26Issue(8)：2921-2923,2930,4.DOI:10.3969/j.issn.1001-3695.2009.08.035
抗体修正免疫算法对高维0/1背包问题的应用
Immune algorithm with antibody-repaired and its application for high-dimensional 0/1 knapsack problem
摘要
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 consistency of antibodies gene. In numerical experiments, selected two existing intelligent algorithms (ETGA , ISGA) to compare with the designed algorithm, tested high-dimensional 0/1 knapsack problems with different constraints. The results indicate that the new algorithm can track rapidly the optimum, and also show the predominant exploitation and exploration capability of algorithm.关键词
高维0/1背包问题/约束优化/抗体修正/免疫算法Key words
high-dimensional 0/1 knapsack problem/constrained optimization/antibody repair/immune algorithms分类
信息技术与安全科学引用本文复制引用
庄中文,钱淑渠..抗体修正免疫算法对高维0/1背包问题的应用[J].计算机应用研究,2009,26(8):2921-2923,2930,4.基金项目
安顺学院青年一般项目基金资助(20080514) （20080514）
