用于解决多目标0／1背包问题的免疫系统Pareto强度算法  

Immune system strength pareto algorithm for multiobjective 0/1 knapsack problems

作　　者：张彬[1] 张小华[1] 公茂果[1] 卢滨[1] 

机构地区：[1]西安电子科技大学智能信息处理研究所,陕西西安710071

出　　处：《哈尔滨工程大学学报》2006年第B07期214-218,共5页Journal of Harbin Engineering University

摘　　要：将人工免疫系统的机理与Pareto强度算法相结合，提出一种用于解决多目标0／1背包问题的免疫系统Pareto强度算法（ISSPA）．ISSPA结合克隆选择操作和注射疫苗操作，并通过免疫特异性度量保持种群的良好多样性和算法的全局搜索能力．与其他多目标进化算法的对比实验证明，ISSPA搜索得到的Pareto解的支配能力和在空间分布的均匀性上较其他几种多目标进化算法有明显的优势．Based on artificial immune system and strength Pareto theory, a novel immune system strength pareto algorithm（ISSPA） for multiobjective 0/1 knapsack problem is proposed. ISSPA integrates clonal selection theory and presents a new operation- inject bacterin operation. Also, ISSPA uses the immune differential degree to increass the diversity of the populations, resulting in more uniformly distributing global Pareto optimal solutions. The comparison of ISSPA with other five representative methods in multiobjective 0/1 knapsack problems suggests that ISSPA clearly outperforms the other five multiobjective optimization evolution algorithms in solutions performances of coverage and distribution

关 键 词：免疫系统 Pareto强度 多目标0/1背包问题 克隆选择 

分 类 号：TP183[自动化与计算机技术—控制理论与控制工程]