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

被引：0

作者：

Grosan, C ^{[1
]}

机构：

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

来源：

CEC2004: PROCEEDINGS OF THE 2004 CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1 AND 2 | 2004年

关键词：

D O I：

暂无

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

The 0/1 knapsack problem is a well known problem occurring in many real world applications. The problem is NP-Complete. 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 epsilon-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.

引用

页码：1958 / 1963

页数：6

共 20 条

[1]

[Anonymous], 2001, 103 TIK DEP EL ENG S

[2] AN ALGORITHM FOR LARGE ZERO-ONE KNAPSACK-PROBLEMS [J].

BALAS, E ;

ZEMEL, E .

OPERATIONS RESEARCH, 1980, 28 (05) :1130-1154

[3] HARD KNAPSACK-PROBLEMS [J].

CHVATAL, V .

OPERATIONS RESEARCH, 1980, 28 (06) :1402-1411

[4]

Corne D. W., 2000, Parallel Problem Solving from Nature PPSN VI. 6th International Conference. Proceedings (Lecture Notes in Computer Science Vol.1917), P839

[5]

Deb K., 2000, Parallel Problem Solving from Nature PPSN VI. 6th International Conference. Proceedings (Lecture Notes in Computer Science Vol.1917), P849

[6] EFFICIENT ALGORITHMS FOR SOLVING MULTICONSTRAINT ZERO-ONE KNAPSACK-PROBLEMS TO OPTIMALITY [J].

GAVISH, B ;

PIRKUL, H .

MATHEMATICAL PROGRAMMING, 1985, 31 (01) :78-105

[7]

GROSAN C, 2003, ZILELE ACAD CLUJENE

[8]

Grosan C., 2003, P C APPL IND MATH OR

[9] REDUCTION ALGORITHM FOR ZERO-ONE SINGLE KNAPSACK PROBLEMS [J].

INGARGIOLA, GP ;

KORSH, JF .

MANAGEMENT SCIENCE SERIES B-APPLICATION, 1973, 20 (04) :460-463

[10] On the performance of multiple-objective genetic local search on the 0/1 knapsack problem - A comparative experiment [J].

Jaszkiewicz, A .

IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (04) :402-412

← 1 2 →