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
关键词
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 条
  • [21] An Empirical Study on Parallel Multi-objective Genetic Algorithms: 0/1 Knapsack Problem-A Case Study
    Mishra, B. S. P.
    Addy, A. K.
    Dehuri, S.
    Cho, S. -B.
    2010 THE 3RD INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND INDUSTRIAL APPLICATION (PACIIA2010), VOL III, 2010, : 400 - 403
  • [22] Quantum Immune Clonal Selection Algorithm for Multi-objective 0/1 Knapsack Problems
    Shang Rong-Hua
    Jiao Li-Cheng
    Li Yang-Yang
    Wu Jian-She
    CHINESE PHYSICS LETTERS, 2010, 27 (01)
  • [23] Multi-objective Evolutionary Approaches for the Knapsack Problem with Stochastic Profits
    Perera, Kokila Kasuni
    Neumann, Frank
    Neumann, Aneta
    PARALLEL PROBLEM SOLVING FROM NATURE-PPSN XVIII, PPSN 2024, PT I, 2024, 15148 : 116 - 132
  • [24] Identifying preferred solutions to Multi-Objective Binary Optimisation problems, with an application to the Multi-Objective Knapsack Problem
    Nikolaos Argyris
    José Rui Figueira
    Alec Morton
    Journal of Global Optimization, 2011, 49 : 213 - 235
  • [25] Hybrid multi-objective Bayesian estimation of distribution algorithm: a comparative analysis for the multi-objective knapsack problem
    Martins, Marcella S. R.
    Delgado, Myriam R. B. S.
    Luders, Ricardo
    Santana, Roberto
    Goncalves, Richard A.
    de Almeida, Carolina P.
    JOURNAL OF HEURISTICS, 2018, 24 (01) : 25 - 47
  • [26] An Analysis of Particle Swarm Optimization of Multi-objective Knapsack Problem
    Liu, Zhuo
    2020 9TH INTERNATIONAL CONFERENCE ON INDUSTRIAL TECHNOLOGY AND MANAGEMENT (ICITM 2020), 2020, : 302 - 306
  • [27] Hybrid multi-objective Bayesian estimation of distribution algorithm: a comparative analysis for the multi-objective knapsack problem
    Marcella S. R. Martins
    Myriam R. B. S. Delgado
    Ricardo Lüders
    Roberto Santana
    Richard A. Gonçalves
    Carolina P. de Almeida
    Journal of Heuristics, 2018, 24 : 25 - 47
  • [28] Identifying preferred solutions to Multi-Objective Binary Optimisation problems, with an application to the Multi-Objective Knapsack Problem
    Argyris, Nikolaos
    Figueira, Jose Rui
    Morton, Alec
    JOURNAL OF GLOBAL OPTIMIZATION, 2011, 49 (02) : 213 - 235
  • [29] Analysis and Comparison of Multi-objective Evolutionary Approaches on the Multi-Objective 1/0 Unit Commitment Problem
    Zapotecas-Martinez, Saul
    Jacquin, Sophie
    Aguirre, Hernan E.
    Tanaka, Kiyoshi
    2016 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2016, : 3019 - 3026
  • [30] An novel artificial immune systems multi-objective optimization algorithm for 0/1 knapsack problems
    Ma, WP
    Jiao, LC
    Gong, MG
    Liu, F
    COMPUTATIONAL INTELLIGENCE AND SECURITY, PT 1, PROCEEDINGS, 2005, 3801 : 793 - 798