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 条
  • [41] Comparing between different approaches to solve the 0/1 Knapsack problem
    Shaheen, Ameen
    Sleit, Azzam
    INTERNATIONAL JOURNAL OF COMPUTER SCIENCE AND NETWORK SECURITY, 2016, 16 (07): : 1 - 10
  • [42] A cooperative swarm intelligence algorithm for multi-objective discrete optimization with application to the knapsack problem
    Zouache, Djaafar
    Moussaoui, Abdelouahab
    Ben Abdelaziz, Fouad
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2018, 264 (01) : 74 - 88
  • [43] Single- and multi-objective evolutionary algorithms for the knapsack problem with dynamically changing constraints
    Roostapour, Vahid
    Neumann, Aneta
    Neumann, Frank
    THEORETICAL COMPUTER SCIENCE, 2022, 924 : 129 - 147
  • [44] DESIGN OF COOPERATIVE OPENMP-BASED METAHEURISTIC APPROACH FOR MULTI-OBJECTIVE KNAPSACK PROBLEM
    Ben Mansour, Imen
    Alaya, Ines
    Tagina, Moncef
    IADIS-INTERNATIONAL JOURNAL ON COMPUTER SCIENCE AND INFORMATION SYSTEMS, 2020, 15 (02): : 44 - 57
  • [45] Mixed Differential Evolution Algorithm for the Multi-Objective 0-1 Programming Problem
    Ning Gui-ying
    Zhou Yong-quan
    2018 IEEE 4TH INTERNATIONAL CONFERENCE ON CONTROL SCIENCE AND SYSTEMS ENGINEERING (ICCSSE 2018), 2018, : 549 - 554
  • [46] On branching heuristics for the bi-objective 0/1 unidimensional knapsack problem
    Cerqueus, Audrey
    Gandibleux, Xavier
    Przybylski, Anthony
    Saubion, Frederic
    JOURNAL OF HEURISTICS, 2017, 23 (05) : 285 - 319
  • [47] Comparison between Single and Multi-Objective Evolutionary Algorithms to Solve the Knapsack Problem and the Travelling Salesman Problem
    Mahrach, Mohammed
    Miranda, Gara
    Leon, Coromoto
    Segredo, Eduardo
    MATHEMATICS, 2020, 8 (11) : 1 - 23
  • [48] On branching heuristics for the bi-objective 0/1 unidimensional knapsack problem
    Audrey Cerqueus
    Xavier Gandibleux
    Anthony Przybylski
    Frédéric Saubion
    Journal of Heuristics, 2017, 23 : 285 - 319
  • [49] Exact algorithm for bi-objective 0-1 knapsack problem
    Jolai, Fariborz
    Rezaee, M. J.
    Rabbani, M.
    Razmi, J.
    Fattahi, Pariviz
    APPLIED MATHEMATICS AND COMPUTATION, 2007, 194 (02) : 544 - 551
  • [50] Set-Based Particle Swarm Optimization for the Multi-objective Multi-dimensional Knapsack Problem
    Spangenberg, Mari
    Engelbrecht, Andries
    ADVANCES IN SWARM INTELLIGENCE, PT I, ICSI 2024, 2024, 14788 : 3 - 19
12345