Comparison between Lamarckian and Baldwinian repair on multiobjective 0/1 Knapsack problems

被引:0
|
作者
Ishibuchi, H [1 ]
Kaige, S [1 ]
Narukawa, K [1 ]
机构
[1] Osaka Prefecture Univ, Dept Ind Engn, Sakai, Osaka 5998531, Japan
来源
关键词
D O I
暂无
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
This paper examines two repair schemes (i.e., Lamarckian and Baldwinian) through computational experiments on multiobjective 0/1 knapsack problems. First we compare Lamarckian and Baldwinian with each other. Experimental results show that the Baldwinian repair outperforms the Lamarckian repair. It is also shown that these repair schemes outperform a penalty function approach. Then we examine partial Lamarckianism where the Lamarckian repair is applied to each individual with a prespecified probability. Experimental results show that a so-called 5% rule works well. Finally partial Lamarckianism is compared with an island model with two subpopulations where each island has a different repair scheme. Experimental results show that the island model slightly outperforms the standard single-population model with the 50% partial Lamarckian repair in terms of the diversity of solutions.
引用
收藏
页码:370 / 385
页数:16
相关论文
共 50 条
  • [1] Spatial implementation of evolutionary multiobjective algorithms with partial Lamarckian repair for multiobjective knapsack problems
    [J]. Ishibuchi, H. (hisaoi@cs.osakafu-u.ac.jp), Coordenacao de Aperfeicoamento de Pessoal de Nivel Superior; Operador Nacional do Sistema Eletrico - ONS (IEEE Computer Society):
  • [2] Spatial implementation of evolutionary multiobjective algorithms with partial Lamarckian repair for multiobjective knapsack problems
    Ishibuchi, H
    Narukawa, K
    [J]. HIS 2005: 5TH INTERNATIONAL CONFERENCE ON HYBRID INTELLIGENT SYSTEMS, PROCEEDINGS, 2005, : 265 - 270
  • [3] Effects of repair procedures on the performance of EMO algorithms for multiobjective 0/1 knapsack problems
    Ishibuchi, H
    Kaige, S
    [J]. CEC: 2003 CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-4, PROCEEDINGS, 2003, : 2254 - 2261
  • [4] A Novel Multiobjective Optimization Algorithm for 0/1 Multiobjective Knapsack Problems
    Chen, Min-Rong
    Weng, Jian
    Li, Xia
    [J]. ICIEA 2010: PROCEEDINGS OF THE 5TH IEEE CONFERENCE ON INDUSTRIAL ELECTRONICS AND APPLICATIONS, VOL 3, 2010, : 359 - +
  • [5] Quantum-inspired multiobjective evolutionary algorithm for multiobjective 0/1 knapsack problems
    Kim, Yehoon
    Kim, Jong-Hwan
    Han, Kuk-Hyun
    [J]. 2006 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-6, 2006, : 2586 - 2591
  • [6] Effects of nongeometric binary crossover on multiobjective 0/1 knapsack problems
    Tsukamoto, N.
    Nojima, Y.
    Ishibuchi, H.
    [J]. ARTIFICIAL LIFE AND ROBOTICS, 2009, 13 (02) : 434 - 437
  • [7] How to Strike a Balance between Local Search and Global Search in Multiobjective Memetic Algorithms for Multiobjective 0/1 Knapsack Problems
    Ishibuchi, Hisao
    Tanigaki, Yuki
    Akedo, Naoya
    Nojima, Yusuke
    [J]. 2013 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2013, : 1643 - 1650
  • [8] Immune system strength pareto algorithm for multiobjective 0/1 knapsack problems
    Institute of Intelligent Information Processing, Xidian University, Xi'an 710071, China
    [J]. Harbin Gongcheng Daxue Xuebao, 2006, SUPPL. (214-218):
  • [9] Local dominance and local recombination in MOEAs on 0/1 multiobjective knapsack problems
    Sato, Hiroyuki
    Aguirre, Hernan E.
    Tanaka, Kiyoshi
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 181 (03) : 1708 - 1723
  • [10] A Hybrid Evolutionary Metaheuristics (HEMH) applied on 0/1 Multiobjective Knapsack Problems
    Kafafy, Ahmed
    Bounekkar, Ahmed
    Bonnevay, Stephane
    [J]. GECCO-2011: PROCEEDINGS OF THE 13TH ANNUAL GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, 2011, : 497 - 504