Comparing representations and recombination operators for the multi-objective 0/1 knapsack problem

被引：0
|
作者：
Mumford, CL [1 ]
机构：
[1] Cardiff Univ, Dept Comp Sci, Cardiff CF24 3XF, S Glam, Wales
来源：
CEC: 2003 CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-4, PROCEEDINGS | 2003年
关键词：
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
The multiple knapsack problem (MKP) is a popular test-bed for researchers developing new Pareto-based multi-objective evolutionary algorithms. This paper explores a range of different representations and operators for the MKP which have been adapted from the single objective case. Results indicate that order-based approaches are superior to binary representations for the problem instances considered here.
引用
收藏
页码：854 / 861
页数：8
相关论文
共 50 条
  • [11] Strawberry optimization for multi-objective knapsack problem
    Mizobe, Yamato
    Ohnishi, Kei
    Fujiwara, Akihiro
    2019 SEVENTH INTERNATIONAL SYMPOSIUM ON COMPUTING AND NETWORKING WORKSHOPS (CANDARW 2019), 2019, : 481 - 483
  • [12] On the Performance of Generational and Steady-State MOEA/D in the Multi-Objective 0/1 Knapsack Problem
    Zapotecas-Martinez, Saul
    Menchaca-Mendez, Adriana
    2020 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2020,
  • [13] A multi-population algorithm for multi-objective knapsack problem
    Ben Mansour, Imen
    Basseur, Matthieu
    Saubion, Frederic
    APPLIED SOFT COMPUTING, 2018, 70 : 814 - 825
  • [14] An intelligent multi-colony multi-objective ant colony optimization (ACO) for the 0-1 knapsack problem
    Chaharsooghi, S. K.
    Kermani, Amir H. Meimand
    2008 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-8, 2008, : 1195 - +
  • [15] Genetic tabu search for the multi-objective knapsack problem
    Barichard, Vincent
    Hao, Jin-Kao
    Tsinghua Science and Technology, 2003, 8 (01) : 8 - 13
  • [16] Robust optimization algorithms for multi-objective knapsack problem
    Miyamoto, Takuya
    Fujiwara, Akihiro
    2022 TENTH INTERNATIONAL SYMPOSIUM ON COMPUTING AND NETWORKING WORKSHOPS, CANDARW, 2022, : 430 - 432
  • [17] Genetic Tabu Search for the Multi-Objective Knapsack Problem
    Vincent Barichard
    Jin-Kao Hao
    Tsinghua Science and Technology, 2003, (01) : 8 - 13
  • [18] An Evolutionary Algorithm for the Multi-objective Multiple Knapsack Problem
    Soylu, Banu
    Koksalan, Murat
    CUTTING-EDGE RESEARCH TOPICS ON MULTIPLE CRITERIA DECISION MAKING, PROCEEDINGS, 2009, 35 : 1 - +
  • [19] An adaptive population multi-objective quantum-inspired evolutionary algorithm for multi-objective 0/1 knapsack problems
    Lu, Tzyy-Chyang
    Yu, Gwo-Ruey
    INFORMATION SCIENCES, 2013, 243 : 39 - 56
  • [20] Solving the 0-1 Multi-objective Knapsack Problem Using Self-assembly of DNA Tiles
    Cheng, Zhen
    Huang, Yufang
    Chen, Zhihua
    Zhang, Xuncai
    Xu, Jin
    2009 FOURTH INTERNATIONAL CONFERENCE ON BIO-INSPIRED COMPUTING: THEORIES AND APPLICATIONS, PROCEEDINGS, 2009, : 137 - +
12345