Comparison between Genetic Network Programming(gnp) and Genetic Programming(gp)

K. Hirasawa*, M. Okubo, J. Hu, H. Katagiri, J. Murata

*この研究の対応する著者

研究成果査読

131 被引用数 (Scopus)

抄録

Recently, many methods of evolutionary computation such as Genetic Algorithm(GA) and Genetic Programming(GP) have been developed as a basic tool for modeling and optimizing the complex systems. Generally speaking, GA has the genome of string structure, while the genome in GP is the tree structure. Therefore, GP is suitable to construct the complicated programs, which can be applied to many real world problems. But, GP might be sometimes difficult to search for a solution because of its bloat. In this paper, a new evolutionary method named Genetic Network Programming(GNP), whose genome is network structure is proposed to overcome the low searching efficiency of GP and is applied to the problem on the evolution of behaviors of ants in order to study the effectiveness of GNP. In addition, the comparison of the performances between GNP and GP is carried out in simulations on ants behaviors.

本文言語English
ページ1276-1282
ページ数7
出版ステータスPublished - 2001 1 1
外部発表はい
イベントCongress on Evolutionary Computation 2001 - Seoul, Korea, Republic of
継続期間: 2001 5 272001 5 30

Conference

ConferenceCongress on Evolutionary Computation 2001
国/地域Korea, Republic of
CitySeoul
Period01/5/2701/5/30

ASJC Scopus subject areas

  • コンピュータ サイエンス(全般)
  • 工学(全般)

フィンガープリント

「Comparison between Genetic Network Programming(gnp) and Genetic Programming(gp)」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル