| ○種別 (必須): | □ | 学術論文 (審査論文)
| [継承] |
| ○言語 (必須): | □ | 日本語
| [継承] |
| ○招待 (推奨): |
| ○審査 (推奨): |
| ○カテゴリ (推奨): |
| ○共著種別 (推奨): |
| ○学究種別 (推奨): |
| ○組織 (推奨): |
| ○著者 (必須): | 1. | (英) (日) 大嶋 彈 (読)
| ○役割 (任意): |
| ○貢献度 (任意): |
| ○学籍番号 (推奨): |
| [継承] |
| 2. | (英) (日) 宮前 惇 (読)
| ○役割 (任意): |
| ○貢献度 (任意): |
| ○学籍番号 (推奨): |
| [継承] |
| 3. | 永田 裕一 ([徳島大学.大学院社会産業理工学研究部.理工学域.知能情報系.情報工学分野]/[徳島大学.理工学部.理工学科.知能情報コース.情報工学講座])
| ○役割 (任意): |
| ○貢献度 (任意): |
| ○学籍番号 (推奨): |
| [継承] |
| 4. | (英) (日) 小林 重信 (読)
| ○役割 (任意): |
| ○貢献度 (任意): |
| ○学籍番号 (推奨): |
| [継承] |
| 5. | 小野 功
| ○役割 (任意): |
| ○貢献度 (任意): |
| ○学籍番号 (推奨): |
| [継承] |
| 6. | (英) (日) 佐久間 淳 (読)
| ○役割 (任意): |
| ○貢献度 (任意): |
| ○学籍番号 (推奨): |
| [継承] |
| ○題名 (必須): | □ | (英) A New Real-coded Genetic Algorithm with an Adaptive Mating Selection for UV-landscapes (日) UV構造を考慮した適応的複製選択による実数値GAの提案
| [継承] |
| ○副題 (任意): |
| ○要約 (任意): | □ | (英) The purpose of this paper is to propose a new real-coded genetic algorithm (RCGA) named Networked Genetic Algorithm (NGA) that intends to find multiple optima simultaneously in deceptive globally multimodal landscapes. Most current techniques such as <I>niching</I> for finding multiple optima take into account <I>big valley</I> landscapes or non-deceptive <I>globally multimodal</I> landscapes but not deceptive ones called <I>UV-landscapes</I>. Adaptive Neighboring Search (ANS) is a promising approach for finding multiple optima in UV-landscapes. ANS utilizes a restricted mating scheme with a crossover-like mutation in order to find optima in deceptive globally multimodal landscapes. However, ANS has a fundamental problem that it does not find all the optima simultaneously in many cases. NGA overcomes the problem by an adaptive parent-selection scheme and an improved crossover-like mutation. We show the effectiveness of NGA over ANS in terms of the number of detected optima in a single run on Fletcher and Powell functions as benchmark problems that are known to have multiple optima, ill-scaledness, and UV-landscapes. (日)
| [継承] |
| ○キーワード (推奨): | 1. | 遺伝的アルゴリズム (genetic algorithm)
| [継承] |
| 2. | (英) function optimization (日) (読)
| [継承] |
| 3. | (英) UV-structure (日) (読)
| [継承] |
| 4. | (英) global multimodality (日) (読)
| [継承] |
| 5. | (英) networked genetic algorithm (日) (読)
| [継承] |
| 6. | (英) deceptive problem (日) (読)
| [継承] |
| ○発行所 (推奨): | □ | 社団法人 人工知能学会
| [継承] |
| ○誌名 (必須): | □ | 人工知能学会論文誌 ([社団法人 人工知能学会])
(pISSN: 1346-0714, eISSN: 1346-8030)
| ○ISSN (任意): | □ | 1346-0714
ISSN: 1346-0714
(pISSN: 1346-0714, eISSN: 1346-8030) Title: Transactions of the Japanese Society for Artificial Intelligence = Jinko Chino Gakkai ronbunshiTitle(ISO): Trans Jpn Soc Artif IntellSupplier: 一般社団法人 人工知能学会Publisher: Japanese Society for Artificial Intelligence (NLM Catalog)
(J-STAGE)
(Scopus)
(CrossRef)
(Scopus information is found. [need login]) | [継承] |
| [継承] |
| ○巻 (必須): | □ | 25
| [継承] |
| ○号 (必須): | □ | 2
| [継承] |
| ○頁 (必須): | □ | 290 298
| [継承] |
| ○都市 (任意): |
| ○年月日 (必須): | □ | 西暦 2010年 3月 初日 (平成 22年 3月 初日)
| [継承] |
| ○URL (任意): | □ | http://ci.nii.ac.jp/naid/130000259121/
| [継承] |
| ○DOI (任意): | □ | 10.1527/tjsai.25.290 (→Scopusで検索)
| [継承] |
| ○PMID (任意): |
| ○CRID (任意): | □ | 1390282680085783680
| [継承] |
| ○NAID : | □ | 130000259121
| [継承] |
| ○WOS (任意): |
| ○Scopus (任意): | □ | 2-s2.0-77955985682
| [継承] |
| ○評価値 (任意): |
| ○被引用数 (任意): |
| ○指導教員 (推奨): |
| ○備考 (任意): |