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 language | English |
|---|---|
| Pages | 1276-1282 |
| Number of pages | 7 |
| Publication status | Published - 2001 Jan 1 |
| Event | Congress on Evolutionary Computation 2001 - Seoul, Korea, Republic of Duration: 2001 May 27 → 2001 May 30 |
Conference
| Conference | Congress on Evolutionary Computation 2001 |
|---|---|
| Country | Korea, Republic of |
| City | Seoul |
| Period | 01/5/27 → 01/5/30 |
ASJC Scopus subject areas
- Computer Science(all)
- Engineering(all)