首页    期刊浏览 2024年12月13日 星期五
登录注册

文章基本信息

  • 标题:交叉する遺伝子数の制御法と解の支配領域の自己制御法による進化型多数目的最適化 0/1ナップザック問題における性能検証
  • 本地全文:下载
  • 作者:佐藤 寛之 ; アギレ エルナン ; 田中 清
  • 期刊名称:進化計算学会論文誌
  • 电子版ISSN:2185-7385
  • 出版年度:2013
  • 卷号:4
  • 期号:2
  • 页码:46-56
  • DOI:10.11394/tjpnsec.4.46
  • 出版社:The Japanese Society for Evolutionary Computation
  • 摘要:

    Crossover controlling the number of crossed genes (CCG) significantly improves the search performance of NSGA-II in many-objective optimization problems (MaOPs). Since the conventional NSGA-II deteriorates convergence of solutions toward the optimal Pareto front in MaOPs, to improve the search performance it is desirable to combine CCG crossover with a parent selection method based on fine-grained ranking of solutions. However, the search performance is not improved when CCG crossover is employed in IBEAε+, which also realizes fine-grained ranking of solutions. That is, in some cases, the search performance is not improved by CCG crossover depending on the parent selection method combined. To further improve the search performance of MOEAs in MaOPs, in this paper we propose a MOEA which employs CCG crossover with a particular parent selection based on fine-grained ranking of solutions. First, to clarify the feature of parent selection improving its search performance by employing CCG, we analyze difference of solutions search between NSGA-II and IBEAε+. As a result, we show that diversity preservation mechanism is absolutely imperative in parent selection to search Pareto optimal solutions of MaOPs broadly distributed in objective/variable space by using CCG crossover. That is, to further improve the search performance, it is necessity to make fine-grained rank of solutions while keeping diversity of solutions in parent selection. To satisfy this requirements in the parent selection, in this work we combine CCG crossover with self-controlling dominance area of solutions (S-CDAS) as the particular parent selection method. Through performance verification using many-objective knapsack problems with 4~10 objectives, we show that the search performance of S-CDAS combined with CCG crossover significantly improves by keeping the number of crossed genes very small. Also, we show that the effectiveness of CCG operator becomes significant as we increase the number of objectives and search performance of S-CDAS with CCG is higher than NSGA-II and IBEAε+ with CCG.

  • 关键词:evolutionary many-objective optimization; controlling the number of crossed genes; self-control of dominance area of solutions; many-objective 0/1 knapsack problem
国家哲学社会科学文献中心版权所有