<会議発表論文>
Accelerating Evolutionary Computation with Elite Obtained in Projected One-Dimensional Spaces
作成者 | |
---|---|
本文言語 | |
出版者 | |
発行日 | |
収録物名 | |
巻 | |
開始ページ | |
終了ページ | |
出版タイプ | |
アクセス権 | |
関連DOI | |
関連DOI | |
関連URI | |
関連情報 | |
概要 | We propose a method for accelerating evolutionary computation (EC) searches using an elite obtained in one-dimensional space and use benchmark functions to evaluate the proposed method. The method pro...jects individuals onto n one-dimensional spaces corresponding to each of the n searching parameter axes, approximates each landscape using Lagrange polynomial interpolation or power function least squares approximation, finds the best coordinate for the approximated shape, obtains an elite by combining the best n found coordinates, and uses the elite for the next generation of the EC. The advantage of this method is that the elite may be easily obtained thanks to their projection onto each onedimensional space and there is a higher possibility that the elite will be located near the global optimum. Experimental tests with differential evolution and eight benchmark functions show that the proposed method accelerates EC convergence significantly, especially in early generations.続きを見る |
目次 | Ⅰ.INTRODUCTION Ⅱ.OBTAINING ELITE FROM A REGRESSION SEARCH SPACE Ⅲ.EXPERIMENTAL EVALUATIONS Ⅳ.DISCUSSIONS Ⅴ.CONCLUSION |
本文ファイル
ファイル | ファイルタイプ | サイズ | 閲覧回数 | 説明 |
---|---|---|---|---|
ICGEC2011Pei | 372 KB | 362 |
詳細
レコードID | |
---|---|
査読有無 | |
主題 | |
ISBN | |
DOI | |
注記 | |
登録日 | 2017.06.14 |
更新日 | 2021.10.06 |