| 多目标0/1背包问题MOEA求解中的修复策略 |
| |
| 引用本文： | 黄林峰,罗文坚,王煦法.多目标0/1背包问题MOEA求解中的修复策略[J].模式识别与人工智能,2009,22(4). |
| |
| 作者姓名： | 黄林峰 罗文坚 王煦法 |
| |
| 作者单位： | 1. 中国科学技术大学,计算机科学与技术系,自然计算与应用实验室,合肥,230027
2. 中国科学技术大学,计算机科学与技术系,自然计算与应用实验室,合肥,230027;中国科学技术大学,安徽省计算与通讯软件重点实验室,合肥,230027 |
| |
| 基金项目： | 国家自然科学基金委海外青年学者合作研究基金 |
| |
| 摘 要： | 多目标进化算法在求解多目标0/1背包问题时常使用修复策略来满足容量约束.文中更全面地考虑物品对各个背包的不同影响,提出两种加权修复策略,分别基于背包容量和容量约束违反程度,并应用于经典算法SPEA2中.在9个标准MOKP测试实例上的实验结果表明,采用该修复策略的SPEA2算法能更有效地收敛到Pareto最优前沿.
|
| 关 键 词： | 多目标进化算法(MOEA) 多目标0/1背包问题(MOKP) 进化多目标优化 加权修复策略 |
Repair Strategies for Multiobjective 0/1 Knapsack Problem in MOEA |
| |
| HUANG Lin-Feng,LUO Wen-Jian,WANG Xu-Fa.Repair Strategies for Multiobjective 0/1 Knapsack Problem in MOEA[J].Pattern Recognition and Artificial Intelligence,2009,22(4). |
| |
| Authors: | HUANG Lin-Feng LUO Wen-Jian WANG Xu-Fa |
| |
| Affiliation: | HUANG Lin-Feng1,LUO Wen-Jian1,2,WANG Xu-Fa1,21(Nature Inspired Computation and Applications Laboratory,Department of Computer Science and Technology,University of Science and Technology of China,Hefei 230027)2(Anhui Province Key Laboratory of Software in Computing and Communication,Hefei 230027) |
| |
| Abstract: | A repair strategy is often adopted to guarantee feasibility of the multiobjective evolutionary algorithms for multiobjective 0/1 knapsack problem(MOKP).In this paper,impacts of each item on all knapsacks are much considered and two novel repair strategies are proposed based on the knapsack capacities and constraint violations,respectively.The two novel strategies are applied to SPEA2 to solve MOKP.The experimental results on 9 standard test cases of MOKP demonstrate that SPEA2 with the proposed repair strat... |
| |
| Keywords: | Multiobjective Optimization Evolutionary Algorithm(MOEA) Multiobjective 0/1 Knapsack Problem(MOKP) Evolutionary Multiobjective Optimization Weighted Scalar Repair Strategy |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
