巻号一覧
> 目次一覧
> 書誌事項
| Vol. 1 (2010) , No. 1 pp.32-42 |
|
|
[PDF]
[引用文献]
|
 |
解の支配領域の自己制御による進化型多数目的最適化: 多数目的 0/1 ナップザック問題における性能検証と挙動解析
|
|
| 佐藤 寛之1), エルナン アギレ2), 田中 清3) |
|
1) 電気通信大学情報理工学部
2) 信州大学国際若手研究者育成拠点
3) 信州大学工学部 |
|
| Summary:
Controlling dominance area of solutions (CDAS) relaxes the concepts of Pareto dominance with an user- defined parameter S. This method enhances the search performance of dominance-based MOEA in many-objective optimization problems (MaOPs). However, to bring out desirable search performance, we have to experimentally find out S that controls dominance areas appropriately. Also, there is a tendency to deteriorate the diversity of solutions obtained by CDAS when we decrease S from 0.5. To solve these problems, in this work, we propose a modification of CDAS called self-controlling dominance area of solutions (S-CDAS). In S-CDAS, the algorithm self-controls dominance areas for each solution without the need of an external parameter. S-CDAS considers convergence and diversity and realizes a fine grained ranking that is different from conventional CDAS. In this work, we focus on combinatorial optimization and use many-objective 0/1 knapsack problems with m = 4 ~ 10 objectives to verify the search performance of the proposed method. Simulation results show that S-CDAS achieves well-balanced search performance on both convergence and diversity compared to conventional NSGA-II, CDAS, IBEAε+ and MSOPS. In addition, the algorithm's behavior of S-CDAS is analyzed and discussed.
|
|
| Keywords: |
many-objective optimization, multi-objective evolutionary algorithms, self-controlling dominance area of solutions, many-objective 0/1 knapsack problem |
|
|
|
本論文を引用する際にご利用ください: |
|
佐藤 寛之, エルナン アギレ, 田中 清: “解の支配領域の自己制御による進化型多数目的最適化: 多数目的 0/1 ナップザック問題における性能検証と挙動解析”, 進化計算学会論文誌, Vol. 1, No. 1, pp.32-42 (2010) . |
|
|
| Copyright (c) 2010 JPNSEC (The Japanese Society for Evolutionary Computation) |
|
|