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 条
  • [21] Solving 0/1 Knapsack Problem Using Hybrid HS and Jaya Algorithms
    Alomoush, Alaa
    Alsewari, AbdulRahman A.
    Alamri, Hammoudeh S.
    Zamli, Kamal Z.
    ADVANCED SCIENCE LETTERS, 2018, 24 (10) : 7486 - 7489
  • [22] Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms
    Florios, Kostas
    Mavrotas, George
    Diakoulaki, Danae
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 203 (01) : 14 - 21
  • [23] Solving the 0/1 knapsack problem using rough sets and genetic algorithms
    Yang, Hsu-Hao
    Wang, Shih-Wen
    JOURNAL OF INDUSTRIAL AND PRODUCTION ENGINEERING, 2011, 28 (05) : 360 - 369
  • [24] A Hybrid Evolutionary Metaheuristics (HEMH) applied on 0/1 Multiobjective Knapsack Problems
    Kafafy, Ahmed
    Bounekkar, Ahmed
    Bonnevay, Stephane
    GECCO-2011: PROCEEDINGS OF THE 13TH ANNUAL GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, 2011, : 497 - 504
  • [25] One-way mutation: an efficient strategy to improve the performance of evolutionary algorithms for solving 0-1 knapsack problem
    He, Yichao
    Wang, Jinghong
    Chen, Guoxin
    Chai, Bianfang
    INTERNATIONAL JOURNAL OF MACHINE LEARNING AND CYBERNETICS, 2025,
  • [26] Local dominance using polar coordinates to enhance multiobjective evolutionary algorithms
    Sato, H
    Aguirre, HE
    Tanaka, K
    CEC2004: PROCEEDINGS OF THE 2004 CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1 AND 2, 2004, : 188 - 195
  • [27] An Evolutionary Algorithm with Masked Mutation for 0/1 Knapsack Problem
    Khan, Mozammel H. A.
    2013 INTERNATIONAL CONFERENCE ON INFORMATICS, ELECTRONICS & VISION (ICIEV), 2013,
  • [28] An evolutionary Lagrangian method for the 0/1 multiple knapsack problem
    Yoon, Yourim
    Kim, Yong-Hyuk
    Moon, Byung-Ro
    GECCO 2005: GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, VOLS 1 AND 2, 2005, : 629 - 635
  • [29] A Developmental Evolutionary Algorithm for 0-1 Knapsack Problem
    Zhong, Ming
    Xu, Bo
    CLOUD COMPUTING AND SECURITY, PT II, 2017, 10603 : 849 - 854
  • [30] On the effectivity of evolutionary algorithms for the multidimensional knapsack problem
    Gottlieb, J
    ARTIFICIAL EVOLUTION, 2000, 1829 : 23 - 37
12345