Effects of nongeometric binary crossover on multiobjective 0/1 knapsack problems

被引:1
|
作者
Tsukamoto, N. [1 ]
Nojima, Y. [1 ]
Ishibuchi, H. [1 ]
机构
[1] Osaka Prefecture Univ, Grad Sch Engn, Dept Comp Sci & Intelligent Syst, Naka Ku, 1-1 Gakuen Cho, Sakai, Osaka 5998531, Japan
基金
日本学术振兴会;
关键词
Nongeometric crossover operators; Evolutionary multiobjective optimization (EMO) algorithms; Multiobjective 0/1 knapsack problems;
D O I
10.1007/s10015-008-0593-6
中图分类号
TP24 [机器人技术];
学科分类号
080202 ; 1405 ;
摘要
Standard binary crossover operators (e.g., one-point, two-point, and uniform) tend to decrease the diversity of solutions while they improve the convergence to the Pareto front. This is because standard binary crossover operators, which are called geometric crossovers, always generate an offspring in the line segment between its parents under the Hamming distance in the genotype space. In our former study, we have already proposed a nongeometric binary crossover operator to generate an offspring outside the line segment between its parents. In this article, we examine the effect of our crossover operator on the performance of evolutionary multiobjective optimization (EMO) algorithms through computational experiments on various multiobjective knapsack problems. Experimental results show that our crossover operator improves the search ability of EMO algorithms for a wide range of test problems.
引用
收藏
页码:434 / 437
页数:4
相关论文
共 50 条
  • [1] 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 - +
  • [2] 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
  • [3] 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
  • [4] Binary Aquila Optimizer for 0-1 knapsack problems
    Bas, Emine
    [J]. ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2023, 118
  • [5] Comparison between Lamarckian and Baldwinian repair on multiobjective 0/1 Knapsack problems
    Ishibuchi, H
    Kaige, S
    Narukawa, K
    [J]. EVOLUTIONARY MULTI-CRITERION OPTIMIZATION, 2005, 3410 : 370 - 385
  • [6] 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):
  • [7] 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
  • [8] 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
  • [9] A fuzzy programming approach to multiobjective multidimensional 0-1 knapsack problems
    Abboud, NJ
    Sakawa, M
    Inuiguchi, M
    [J]. FUZZY SETS AND SYSTEMS, 1997, 86 (01) : 1 - 14
  • [10] Performance evaluation, of simple multiobjective genetic local search algorithms on multiobjective 0/1 knapsack problems
    Ishibuchi, H
    Narukawa, K
    [J]. CEC2004: PROCEEDINGS OF THE 2004 CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1 AND 2, 2004, : 441 - 448