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 条
  • [41] Improving Proximity and Diversity in Multiobjective Evolutionary Algorithms
    Ahn, Chang Wook
    Kim, Yehoon
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2010, E93D (10) : 2879 - 2882
  • [42] An Improved Approach for Solving 0/1 Knapsack Problem In Polynomial Time Using Genetic Algorithms
    Sachdeva, Charu
    Gael, Shivani
    2014 RECENT ADVANCES AND INNOVATIONS IN ENGINEERING (ICRAIE), 2014,
  • [43] A Novel Multiobjective Optimization Algorithm for 0/1 Multiobjective Knapsack Problems
    Chen, Min-Rong
    Weng, Jian
    Li, Xia
    ICIEA 2010: PROCEEDINGS OF THE 5TH IEEE CONFERENCE ON INDUSTRIAL ELECTRONICS AND APPLICATIONS, VOL 3, 2010, : 359 - +
  • [44] Evolutionary Algorithms for the Chance-Constrained Knapsack Problem
    Xie, Yue
    Harper, Oscar
    Assimi, Hirad
    Neumann, Aneta
    Neumann, Frank
    PROCEEDINGS OF THE 2019 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE (GECCO'19), 2019, : 338 - 346
  • [45] Hybrid evolutionary algorithms for a multiobjective financial problem
    Mullei, S
    Beling, P
    1998 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS, VOLS 1-5, 1998, : 3925 - 3930
  • [46] Evolutionary Algorithms for the Multiobjective Shortest Path Problem
    Pangilinan, Jose Maria A.
    Janssens, Gerrit K.
    PROCEEDINGS OF WORLD ACADEMY OF SCIENCE, ENGINEERING AND TECHNOLOGY, VOL 19, 2007, 19 : 205 - +
  • [47] A Schema-Guiding Evolutionary Algorithm for 0-1 Knapsack Problem
    Liu, Yan
    Liu, Chao
    IACSIT-SC 2009: INTERNATIONAL ASSOCIATION OF COMPUTER SCIENCE AND INFORMATION TECHNOLOGY - SPRING CONFERENCE, 2009, : 160 - 164
  • [48] The inverse {0,1}-knapsack problem: Theory, algorithms and computational experiments
    Roland, Julien
    Figueira, Jose Rui
    De Smet, Yves
    DISCRETE OPTIMIZATION, 2013, 10 (02) : 181 - 192
  • [49] Exact algorithms for the 0-1 Time-Bomb Knapsack Problem
    Monaci, Michele
    Pike-Burke, Ciara
    Santini, Alberto
    COMPUTERS & OPERATIONS RESEARCH, 2022, 145
  • [50] Approximation algorithms on 0–1 linear knapsack problem with a single continuous variable
    Chenxia Zhao
    Xianyue Li
    Journal of Combinatorial Optimization, 2014, 28 : 910 - 916
12345