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
相关论文
共 50 条
  • [1] Improving the performance of evolutionary algorithms for the multiobjective 0/1 knapsack problem using ε-dominance
    Grosan, C
    CEC2004: PROCEEDINGS OF THE 2004 CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1 AND 2, 2004, : 1958 - 1963
  • [2] Multiobjective 0/1 knapsack problem using adaptive ε-dominance
    Grosan, Crina
    APPLIED SOFT COMPUTING TECHNOLOGIES: THE CHALLENGE OF COMPLEXITY, 2006, 34 : 547 - 556
  • [3] Evolutionary and heuristic algorithms for multiobjective 0-1 knapsack problem
    Kumar, Rajeev
    Singh, R. K.
    Singhal, A. P.
    Bhartia, Atul
    APPLICATIONS OF SOFT COMPUTING: RECENT TRENDS, 2006, : 331 - +
  • [4] Analysis of a Multiobjective Evolutionary Algorithm on the 0-1 knapsack problem
    Kumar, Rajeev
    Banerjee, Nilanjan
    THEORETICAL COMPUTER SCIENCE, 2006, 358 (01) : 104 - 120
  • [5] AN EVOLUTIONARY MULTIOBJECTIVE GENETIC ALGORITHM TO SOLVE 0/1 KNAPSACK PROBLEM
    Mohanty, Sachi Nandan
    Satapathy, Rabinarayan
    2009 2ND IEEE INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND INFORMATION TECHNOLOGY, VOL 3, 2009, : 392 - +
  • [6] A EVOLUTIONARY MULTIOBJECTIVE GENETIC ALGORITHM TO SOLVE 0/1 KNAPSACK PROBLEM
    Swetanisha, Subhra
    Mishra, Bhabani Sankar Prasad
    PROCEEDINGS OF 2009 INTERNATIONAL CONFERENCE ON COMPUTER ENGINEERING AND APPLICATIONS, 2009, : 232 - 236
  • [7] Performance evaluation of evolutionary class of algorithms - An application to 0-1 knapsack problem
    Dutta, P
    DuttaMajumder, D
    MATHEMATICAL AND COMPUTER MODELLING, 1998, 27 (07) : 57 - 72
  • [8] Running time analysis of evolutionary algorithms on a simplified multiobjective knapsack problem
    Laumanns M.
    Thiele M.
    Zitzler E.
    Natural Computing, 2004, 3 (1) : 37 - 51
  • [9] Performance evaluation, of simple multiobjective genetic local search algorithms on multiobjective 0/1 knapsack problems
    Ishibuchi, H
    Narukawa, K
    CEC2004: PROCEEDINGS OF THE 2004 CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1 AND 2, 2004, : 441 - 448
  • [10] Effects of repair procedures on the performance of EMO algorithms for multiobjective 0/1 knapsack problems
    Ishibuchi, H
    Kaige, S
    CEC: 2003 CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-4, PROCEEDINGS, 2003, : 2254 - 2261
12345