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 条
  • [31] Spatial implementation of evolutionary multiobjective algorithms with partial Lamarckian repair for multiobjective knapsack problems
    Ishibuchi, H
    Narukawa, K
    HIS 2005: 5TH INTERNATIONAL CONFERENCE ON HYBRID INTELLIGENT SYSTEMS, PROCEEDINGS, 2005, : 265 - 270
  • [32] Spatial implementation of evolutionary multiobjective algorithms with partial Lamarckian repair for multiobjective knapsack problems
    Ishibuchi, H. (hisaoi@cs.osakafu-u.ac.jp), Coordenacao de Aperfeicoamento de Pessoal de Nivel Superior; Operador Nacional do Sistema Eletrico - ONS (IEEE Computer Society):
  • [33] Solving the Parameterless Firefighter Problem using Multiobjective Evolutionary Algorithms
    Michalak, Krzysztof
    PROCEEDINGS OF THE 2019 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE COMPANION (GECCCO'19 COMPANION), 2019, : 1321 - 1328
  • [34] Research on genetic algorithms for the discounted {0-1} knapsack problem
    He Y.-C.
    Wang X.-Z.
    Li W.-B.
    Zhang X.-L.
    Chen Y.-Y.
    2016, Science Press (39): : 2614 - 2630
  • [35] Behavior of Multiobjective Evolutionary Algorithms on Many-Objective Knapsack Problems
    Ishibuchi, Hisao
    Akedo, Naoya
    Nojima, Yusuke
    IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2015, 19 (02) : 264 - 283
  • [36] MIXED-INTEGER ALGORITHMS FOR (0,1) KNAPSACK PROBLEM
    GUIGNARD, MM
    SPIELBERG, K
    IBM JOURNAL OF RESEARCH AND DEVELOPMENT, 1972, 16 (04) : 424 - +
  • [37] New trends in exact algorithms for the 0-1 knapsack problem
    Martello, S
    Pisinger, D
    Toth, P
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2000, 123 (02) : 325 - 332
  • [38] Analyzing the performance of hybrid evolutionary algorithms for the multiobjective quadratic assignment problem
    Garrett, Deon
    Dasgupta, Dipankar
    2006 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-6, 2006, : 1695 - +
  • [39] Exact and approximate algorithms for discounted {0-1} knapsack problem
    He, Yi-Chao
    Wang, Xi-Zhao
    He, Yu-Lin
    Zhao, Shu-Liang
    Li, Wen-Bin
    INFORMATION SCIENCES, 2016, 369 : 634 - 647
  • [40] Improved Dynamic Programming Algorithms for the 0-1 Knapsack Problem
    Meng, Xiaohua
    Zhu, Yue-an
    Wu, Xiaoming
    PROCEEDINGS OF 2010 3RD IEEE INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND INFORMATION TECHNOLOGY (ICCSIT 2010), VOL 8, 2010, : 19 - 22
12345