Genetic network programming with route nodes

Created by W.Langdon from gp-bibliography.bib Revision:1.3872

@InProceedings{Ye:2010:ieeetencon,
  author =       "Fengming Ye and Shingo Mabu and Lutao Wang and 
                 Kotaro Hirasawa",
  title =        "Genetic network programming with route nodes",
  booktitle =    "IEEE Region 10 Conference TENCON 2010",
  year =         "2010",
  month =        "21-24 " # nov,
  pages =        "1404--1409",
  abstract =     "Many classical methods such as Genetic Algorithm (GA),
                 Genetic Programming (GP), Evolutionary Strategies (ES),
                 etc. have accomplished significant contribution to the
                 study of evolutionary computation. And in the past
                 decade, a new approach named Genetic Network
                 Programming (GNP) has been proposed. It is designed for
                 especially solving complex problems in dynamic
                 environments. Generally speaking, GNP is based on the
                 algorithms of existed classical evolutionary
                 computation techniques and uses the data structure of
                 directed graphs which becomes the unique feature of
                 GNP. So far, many studies have indicated that GNP can
                 solve the complex problems in the dynamic environments
                 very efficiently and effectively. Focusing on GNP's
                 distinguished expression ability of the graph
                 structure, this paper proposes an enhanced architecture
                 for the standard GNP in order to improve the
                 performance of GNP by using the exploited information
                 extensively during the evolution process of GNP. In the
                 enhanced architecture, the important gene information
                 of the elite individuals is extracted and accumulated
                 during evolution. And among the accumulated
                 information, some of them are selected and encapsulated
                 in the Route Nodes which are used to guide the
                 evolution process. In this paper, the proposed
                 architecture has been applied to the tile-world which
                 is an excellent bench mark for evaluating the
                 evolutionary computation architecture. The performance
                 of the GNP with Route Nodes (GNP-RN) is compared with
                 the conventional GNP. The simulation results show some
                 merits of the proposed method over the conventional
                 GNPs demonstrating its superiority.",
  keywords =     "genetic algorithms, genetic programming, data
                 structure, directed graph, evolutionary computation
                 architecture, evolutionary strategy, genetic network
                 programming, problems solving, route nodes, data
                 structures, directed graphs, problem solving",
  DOI =          "doi:10.1109/TENCON.2010.5686115",
  ISSN =         "pending",
  notes =        "Also known as \cite{5686115}",
}

Genetic Programming entries for Fengming Ye Shingo Mabu Lutao Wang Kotaro Hirasawa

Citations