首页> 外文会议>International Conference on Computational Intelligence and Security(CIS 2005) pt.1; 20051215-19; Xi'an(CN) >An Novel Artificial Immune Systems Multi-objective Optimization Algorithm for 0/1 Knapsack Problems
【24h】

An Novel Artificial Immune Systems Multi-objective Optimization Algorithm for 0/1 Knapsack Problems

机译:0/1背包问题的新型人工免疫系统多目标优化算法

获取原文
获取原文并翻译 | 示例

摘要

Based on the concept of Immunodominance and Antibody Clonal Selection Theory, This paper proposes a new artificial immune system algorithm, Immune Dominance Clonal Multiobjective Algorithm (IDCMA), for multiobjective 0/1 knapsack problems. IDCMA divides the individual population into three sub-populations and adopts different evolution and selection strategies at them, but the update of each sub-population is not carried out all alone. The performance comparisons among IDCMA, SPEA, HLGA, NPGA, NSGA and VEGA show that IDCMA clearly outperforms the other five MOEAs in terms of solution quality.
机译:基于免疫优势和抗体克隆选择理论的概念,针对多目标0/1背包问题,提出了一种新的人工免疫系统算法,即免疫优势克隆多目标算法(IDCMA)。 IDCMA将个体种群划分为三个子种群,并在其上采用不同的进化和选择策略,但是并不是单独对每个子种群进行更新。 IDCMA,SPEA,HLGA,NPGA,NSGA和VEGA之间的性能比较表明,IDCMA在解决方案质量方面明显优于其他五个MOEA。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号