Quantum Immune Clonal Selection Algorithm for Multi-objective 0/1 Knapsack Problems

• 作者: 吴建设 尚荣华 李阳阳 焦李成
• 来源期刊: 中国物理快报(英文版)
• 学科: 工学
• 关键词: 克隆选择算法 背包问题 量子计算 多目标 免疫 帕累托最优 算法原理 更新策略
• 年，卷（期）: 2010,（1）
• 页码范围: 37-40
• 页数: 4页
• 分类号: TP311.13 O224
• 语种: 英文

摘要

Based on the concept and principles of quantum computing and the principle of the immune clonal selection, a new algorithm for multi-objective 0/1 knapsack problems is introduced. In the algorithm, for the novel representation, qubit antibodies in the antibody population are updated by applying a new chaos update strategy. A quantitative metric is used for testing the convergence to the Pareto-optimal front. Simulation results on the 0/1 knapsack problems show that the new algorithm, in most cases, is more effective.