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

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

研究成果: Contribution to conferencePaper

127 引用 (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.

元の言語英語
ページ1276-1282
ページ数7
出版物ステータス出版済み - 1 1 2001
イベントCongress on Evolutionary Computation 2001 - Seoul, 大韓民国
継続期間: 5 27 20015 30 2001

その他

その他Congress on Evolutionary Computation 2001
大韓民国
Seoul
期間5/27/015/30/01

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Engineering(all)

フィンガープリント Comparison between Genetic Network Programming(gnp) and Genetic Programming(gp)' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用

    Hirasawa, K., Okubo, M., Hu, J., Katagiri, H., & Murata, J. (2001). Comparison between Genetic Network Programming(gnp) and Genetic Programming(gp). 1276-1282. 論文発表場所 Congress on Evolutionary Computation 2001, Seoul, 大韓民国.