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 条
  • [31] Indicator Based Ant Colony Optimization for Multi-Objective Knapsack Problem
    Ben Mansour, Imen
    Alaya, Ines
    KNOWLEDGE-BASED AND INTELLIGENT INFORMATION & ENGINEERING SYSTEMS 19TH ANNUAL CONFERENCE, KES-2015, 2015, 60 : 448 - 457
  • [32] Interactive decision making algorithm for multi-objective nonlinear knapsack problem
    Hikita, M
    Isada, Y
    ISIM'2000: PROCEEDINGS OF THE FIFTH CHINA-JAPAN INTERNATIONAL SYMPOSIUM ON INDUSTRIAL MANAGEMENT, 2000, : 350 - 355
  • [33] A Mixed-Factor Evolutionary Algorithm for Multi-objective Knapsack Problem
    Du, Yanlian
    Feng, Zejing
    Shen, Yijun
    INTELLIGENT COMPUTING THEORIES AND APPLICATION (ICIC 2022), PT I, 2022, 13393 : 51 - 67
  • [34] An improved interactive hybrid method for the linear multi-objective knapsack problem
    Cho, KI
    Kim, SH
    COMPUTERS & OPERATIONS RESEARCH, 1997, 24 (11) : 991 - 1003
  • [35] Approximating multi-objective knapsack problems
    Erlebach, T
    Kellerer, H
    Pferschy, U
    ALGORITHMS AND DATA STRUCTURES, 2001, 2125 : 210 - 221
  • [36] Improved interactive hybrid method for the linear multi-objective knapsack problem
    Dongduk Women's Univ, Seoul, Korea, Republic of
    Romput Oper Res, 11 (991-1003):
  • [37] Multi-objective database queries in combined knapsack and set covering problem domains
    Mochocki, Sean A.
    Lamont, Gary B.
    Leishman, Robert C.
    Kauffman, Kyle J.
    JOURNAL OF BIG DATA, 2021, 8 (01)
  • [38] Multi-objective database queries in combined knapsack and set covering problem domains
    Sean A. Mochocki
    Gary B. Lamont
    Robert C. Leishman
    Kyle J. Kauffman
    Journal of Big Data, 8
  • [39] A Multi-objective Particle Swarm Optimization for Multiple Knapsack Problem with Strong Constraints
    Ma, Xuan
    Yan, Ying
    Liu, Qing
    PROCEEDINGS OF THE 2018 13TH IEEE CONFERENCE ON INDUSTRIAL ELECTRONICS AND APPLICATIONS (ICIEA 2018), 2018, : 1201 - 1205
  • [40] A Comparison of Decoding Strategies for the 0/1 Multi-objective Unit Commitment Problem
    Jacquin, Sophie
    Mousin, Lucien
    Machado, Igor
    Talbi, El-Ghazali
    Jourdan, Laetitia
    EVOLUTIONARY MULTI-CRITERION OPTIMIZATION, PT I, 2015, 9018 : 381 - 395
12345