Improving the performance of evolutionary algorithms for the multiobjective 0/1 knapsack problem using ε-dominance

被引：0

作者：

Grosan, C ^{[1
]}

Oltean, M ^{[1
]}

机构：

[1] Univ Babes Bolyai, Fac Math & Comp Sci, Dept Comp Sci, R-3400 Cluj Napoca, Romania

来源：

COMPUTATIONAL SCIENCE - ICCS 2004, PT 2, PROCEEDINGS | 2004年 / 3037卷

关键词：

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

The multiobjective 0/1 knapsack problem is a generalization of the 0/1 knapsack problem in which multiple knapsacks are considered. A new evolutionary algorithm for solving multiobjective 0/1 knapsack problem is proposed in this paper. This algorithm used a e-dominance relation for direct comparison of two solutions. Several numerical experiments are performed using the best recent algorithms proposed for this problem. Experimental results clearly show that the proposed algorithm outperforms the existing evolutionary approaches for this problem.

引用

页码：674 / 677

页数：4