抄録
A new evolutionary algorithm named « genetic network programming, GNP» has been proposed. GNP represents its solutions as network structures, which can improve the expression and search ability. Since GA, GP, and GNP already proposed are based on evolution and they cannot change their solutions until one generation ends, we propose GNP with learning and evolution in order to adapt to a dynamical environment quickly. Learning algorithm improves search speed for solutions and evolutionary algorithm enables GNP to search wide solution space efficiently.
| 本文言語 | English |
|---|---|
| ページ | 69-76 |
| ページ数 | 8 |
| DOI | |
| 出版ステータス | Published - 2003 |
| イベント | 2003 Congress on Evolutionary Computation, CEC 2003 - Canberra, ACT, Australia 継続期間: 2003 12月 8 → 2003 12月 12 |
Conference
| Conference | 2003 Congress on Evolutionary Computation, CEC 2003 |
|---|---|
| 国/地域 | Australia |
| City | Canberra, ACT |
| Period | 03/12/8 → 03/12/12 |
ASJC Scopus subject areas
- 計算数学