| ○種別 (必須): | □ | 学術論文 (審査論文)
| [継承] |
| ○言語 (必須): | □ | 日本語
| [継承] |
| ○招待 (推奨): |
| ○審査 (推奨): |
| ○カテゴリ (推奨): |
| ○共著種別 (推奨): |
| ○学究種別 (推奨): |
| ○組織 (推奨): |
| ○著者 (必須): | 1. | (英) (日) 濱田 直希 (読)
| ○役割 (任意): |
| ○貢献度 (任意): |
| ○学籍番号 (推奨): |
| [継承] |
| 2. | 永田 裕一 ([徳島大学.大学院社会産業理工学研究部.理工学域.知能情報系.情報工学分野]/[徳島大学.理工学部.理工学科.知能情報コース.情報工学講座])
| ○役割 (任意): |
| ○貢献度 (任意): |
| ○学籍番号 (推奨): |
| [継承] |
| 3. | (英) (日) 小林 重信 (読)
| ○役割 (任意): |
| ○貢献度 (任意): |
| ○学籍番号 (推奨): |
| [継承] |
| 4. | 小野 功
| ○役割 (任意): |
| ○貢献度 (任意): |
| ○学籍番号 (推奨): |
| [継承] |
| ○題名 (必須): | □ | (英) On the Stopping Criterion of Adaptive Weighted Aggregation for Multiobjective Continuous Optimization (日) 多目的連続関数最適化の解法Adaptive Weighted Aggregationの終了条件に関する一考察
| [継承] |
| ○副題 (任意): |
| ○要約 (任意): | □ | (英) This paper proposes a reasonable stopping criterion for Adaptive Weighted Aggregation (AWA), which is a scalarization-based multi-start framework developed in our previous study on continuous multiobjective optimization. Our previous study shows that AWA yields good solutions covering the entire Pareto set and front within a small consumption of running time and function evaluation on 2- to 6-objective benchmark problems. The experimental results also indicate, however, that the number of solutions generated by AWA is multiplied every iteration. The rapid increase of solutions requires a careful choice of the stopping criterion: even one iteration of shortage may deteriorate the coverage of solutions into an unsatisfactory level and one of excess gives rise to a significant waste of computational resources. We therefore discuss the minimum iteration that AWA yields an enough solution set to cover the Pareto set and front in the sense that the set contains at least one interior point of each of their non-empty "faces", that is, boundary submanifolds induced from the Pareto sets of subproblems with the same inclusion relation as faces of the simplex. Then, such an iteration, named the <em>representing iteration</em>, is proposed as a stopping criterion for AWA, and the number of solutions found by the representing iteration, named the <em>representing number</em>, is derived to analyze the space complexity of AWA. We also discuss the time complexity of AWA based on numerical experiments. The distribution of obtained solutions and its coverage measure show the usefulness of the proposed stopping criterion. (日)
| [継承] |
| ○キーワード (推奨): | 1. | (英) multi-objective optimization (日) (読)
| [継承] |
| 2. | (英) continuous optimization (日) (読)
| [継承] |
| 3. | (英) scalarization (日) (読)
| [継承] |
| 4. | (英) multi-start search (日) (読)
| [継承] |
| 5. | (英) weight adaptation (日) (読)
| [継承] |
| ○発行所 (推奨): | □ | (英) The Japanese Society for Evolutionary Computation (日) 進化計算学会 (読)
| [継承] |
| ○誌名 (必須): | □ | 進化計算学会論文誌 (進化計算学会)
(eISSN: 2185-7385)
| ○ISSN (任意): | □ | 2185-7385
ISSN: 2185-7385
(eISSN: 2185-7385) Title: 進化計算学会論文誌Supplier: 進化計算学会 (J-STAGE)
(No Scopus information.) | [継承] |
| [継承] |
| ○巻 (必須): | □ | 4
| [継承] |
| ○号 (必須): | □ | 1
| [継承] |
| ○頁 (必須): | □ | 13 27
| [継承] |
| ○都市 (任意): |
| ○年月日 (必須): | □ | 西暦 2013年 3月 初日 (平成 25年 3月 初日)
| [継承] |
| ○URL (任意): | □ | https://ci.nii.ac.jp/naid/130004965146/
| [継承] |
| ○DOI (任意): | □ | 10.11394/tjpnsec.4.13 (→Scopusで検索)
| [継承] |
| ○PMID (任意): |
| ○CRID (任意): | □ | 1390282680343138944
| [継承] |
| ○NAID : | □ | 130004965146
| [継承] |
| ○WOS (任意): |
| ○Scopus (任意): |
| ○評価値 (任意): |
| ○被引用数 (任意): |
| ○指導教員 (推奨): |
| ○備考 (任意): |