Cartesian Ant Programming

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

@InProceedings{Hara:2011:SMC,
  author =       "Akira Hara and Manabu Watanabe and 
                 Tetsuyuki Takahama",
  title =        "Cartesian Ant Programming",
  booktitle =    "IEEE International Conference on Systems, Man, and
                 Cybernetics (SMC 2011)",
  year =         "2011",
  month =        "9-12 " # oct,
  pages =        "3161--3166",
  address =      "Anchorage, Alaska, USA",
  size =         "6 pages",
  abstract =     "Genetic Programming (GP) is well-known as an
                 evolutionary method for automatic programming. GP can
                 optimise tree-structural programs. Cartesian GP (CGP)
                 is one of the extensions of GP, which generates the
                 graph structural programs. By using the graph
                 structure, the solutions can be represented by more
                 compact programs. Therefore, CGP is widely applied to
                 the various problems. As a different approach from the
                 evolution, there is the Ant Colony Optimisation (ACO),
                 which is an optimisation method for combinatorial
                 optimisation problems based on the cooperative
                 behaviour of ants. By using pheromone communication,
                 the promising solution space can be searched
                 intensively. In this paper, we propose a new automatic
                 programming method, which combines CGP and ACO. In this
                 method, ants generate programs by moving in the
                 node-network used in CGP. We call this method,
                 Cartesian Ant Programming (CAP). We examined the
                 effectiveness of CAP by comparing with CGP on the
                 search performance in a symbolic regression and a
                 classification problem.",
  keywords =     "genetic algorithms, genetic programming, cartesian
                 genetic programming, ant colony optimisation, automatic
                 programming, cartesian ant programming, classification
                 problem, combinatorial optimisation, compact program,
                 evolutionary method, graph structural program,
                 pheromone communication, symbolic regression,
                 tree-structural program optimisation, ant colony
                 optimisation, trees (mathematics)",
  DOI =          "doi:10.1109/ICSMC.2011.6084146",
  ISSN =         "1062-922X",
  notes =        "Also known as \cite{6084146}",
}

Genetic Programming entries for Akira Hara Manabu Watanabe Tetsuyuki Takahama

Citations