Geometric PSO + GP = Particle Swarm Programming

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

  author =       "Julian Togelius and Renzo {De Nardi} and 
                 Alberto Moraglio",
  title =        "Geometric PSO + GP = Particle Swarm Programming",
  booktitle =    "Proceedings of the IEEE World Congress on
                 Computational Intelligence",
  year =         "2008",
  editor =       "Jun Wang",
  pages =        "3594--3600",
  address =      "Hong Kong",
  month =        "1-6 " # jun,
  organisation = "IEEE Computational Intelligence Society",
  publisher =    "IEEE Press",
  isbn13 =       "978-1-4244-1823-7",
  file =         "EC0771.pdf",
  keywords =     "genetic algorithms, genetic programming, PSO",
  URL =          "",
  DOI =          "doi:10.1109/CEC.2008.4631284",
  size =         "7 pages",
  abstract =     "Geometric particle swarm optimisation (GPSO) is a
                 recently introduced formal generalisation of
                 traditional particle swarm optimization (PSO) that
                 applies naturally to both continuous and combinatorial
                 spaces. In this paper we apply GPSO to the space of
                 genetic programs represented as expression trees,
                 uniting the paradigms of genetic programming and
                 particle swarm optimisation. The result is a particle
                 swarm flying through the space of genetic programs. We
                 present initial experimental results for our new
  notes =        "Santa Fe ant, sextic polynomial

                 CEC 2008 - A joint meeting of the IEEE, the EPS, and
                 the IET. WCCI 2008 - A joint meeting of the IEEE, the
                 INNS, the EPS and the IET.

                 INSPEC Accession Number: 10250984",

Genetic Programming entries for Julian Togelius Renzo De Nardi Alberto Moraglio