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

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

Research output: Contribution to conference › Paper

127 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages1276-1282
Number of pages7
Publication statusPublished - Jan 1 2001
EventCongress on Evolutionary Computation 2001 - Seoul, Korea, Republic of
Duration: May 27 2001 → May 30 2001

Other

OtherCongress on Evolutionary Computation 2001
CountryKorea, Republic of
CitySeoul
Period5/27/01 → 5/30/01

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Engineering(all)

Access to Document

Fingerprint Dive into the research topics of 'Comparison between Genetic Network Programming(gnp) and Genetic Programming(gp)'. Together they form a unique fingerprint.

    • Cite this

    Hirasawa, K., Okubo, M., Hu, J., Katagiri, H., & Murata, J. (2001). Comparison between Genetic Network Programming(gnp) and Genetic Programming(gp). 1276-1282. Paper presented at Congress on Evolutionary Computation 2001, Seoul, Korea, Republic of.