Cartesian ant programming with transition rule considering internode distance

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

@InProceedings{Kushida:2016:IWCIA,
  author =       "Jun-ichi Kushida and Akira Hara and 
                 Tetsuyuki Takahama and Shogo Nagura",
  booktitle =    "2016 IEEE 9th International Workshop on Computational
                 Intelligence and Applications (IWCIA)",
  title =        "Cartesian ant programming with transition rule
                 considering internode distance",
  year =         "2016",
  pages =        "101--105",
  abstract =     "In recent years, Cartesian Ant Programming (CAP) has
                 been proposed as a swarm-based automatic programming
                 method, which combines graph representations in
                 Cartesian Genetic Programming with search mechanism of
                 Ant Colony Optimisation. In CAP, once an ant jumps a
                 number of nodes, the skipped nodes are not used and
                 wasted in search. To make the use frequency of nodes
                 uniform, we propose CAP with transition rule
                 considering inter node distance. We focus on the
                 distance at the beginning of search to use a large
                 number of nodes for exploration of search. As the
                 search proceeds, the search comes to depend on the
                 pheromone information for exploitation of search. In
                 addition, to prevent the excessive use of the
                 unnecessary nodes, we modify the method of dynamic
                 symbol assignments to nodes so that not only functional
                 symbols but also terminal symbols can be assigned to
                 the respective nodes. We examined the effectiveness of
                 our proposed method by applying it to symbolic
                 regression problems. From the experimental results, we
                 confirmed the improvement of performance and the relief
                 of bias in use frequency of nodes by our proposed
                 method.",
  keywords =     "genetic algorithms, genetic programming, cartesian
                 genetic programming",
  DOI =          "doi:10.1109/IWCIA.2016.7805756",
  month =        nov,
  notes =        "Also known as \cite{7805756}",
}

Genetic Programming entries for Jun-ichi Kushida Akira Hara Tetsuyuki Takahama Shogo Nagura

Citations