Geometric PSO + GP = particle swarm programming

Julian Togelius, Renzo De Nardi, Alberto Moraglio

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Abstract

    Geometric particle swarm optimization (GPSO) is a recently introduced formal generalization 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 optimization. The result is a particle swarm flying through the space of genetic programs. We present initial experimental results for our new algorithm.

    Original languageEnglish (US)
    Title of host publication2008 IEEE Congress on Evolutionary Computation, CEC 2008
    Pages3594-3600
    Number of pages7
    DOIs
    StatePublished - 2008
    Event2008 IEEE Congress on Evolutionary Computation, CEC 2008 - Hong Kong, China
    Duration: Jun 1 2008Jun 6 2008

    Other

    Other2008 IEEE Congress on Evolutionary Computation, CEC 2008
    CountryChina
    CityHong Kong
    Period6/1/086/6/08

    Fingerprint

    Geometric Optimization
    Particle Swarm
    Particle swarm optimization (PSO)
    Particle Swarm Optimization
    Programming
    Genetic programming
    Genetic Programming
    Paradigm
    Experimental Results

    ASJC Scopus subject areas

    • Computational Theory and Mathematics
    • Theoretical Computer Science

    Cite this

    Togelius, J., De Nardi, R., & Moraglio, A. (2008). Geometric PSO + GP = particle swarm programming. In 2008 IEEE Congress on Evolutionary Computation, CEC 2008 (pp. 3594-3600). [4631284] https://doi.org/10.1109/CEC.2008.4631284

    Geometric PSO + GP = particle swarm programming. / Togelius, Julian; De Nardi, Renzo; Moraglio, Alberto.

    2008 IEEE Congress on Evolutionary Computation, CEC 2008. 2008. p. 3594-3600 4631284.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Togelius, J, De Nardi, R & Moraglio, A 2008, Geometric PSO + GP = particle swarm programming. in 2008 IEEE Congress on Evolutionary Computation, CEC 2008., 4631284, pp. 3594-3600, 2008 IEEE Congress on Evolutionary Computation, CEC 2008, Hong Kong, China, 6/1/08. https://doi.org/10.1109/CEC.2008.4631284
    Togelius J, De Nardi R, Moraglio A. Geometric PSO + GP = particle swarm programming. In 2008 IEEE Congress on Evolutionary Computation, CEC 2008. 2008. p. 3594-3600. 4631284 https://doi.org/10.1109/CEC.2008.4631284
    Togelius, Julian ; De Nardi, Renzo ; Moraglio, Alberto. / Geometric PSO + GP = particle swarm programming. 2008 IEEE Congress on Evolutionary Computation, CEC 2008. 2008. pp. 3594-3600
    @inproceedings{f80d3aa7396349f0a533e8fc9eb92e61,
    title = "Geometric PSO + GP = particle swarm programming",
    abstract = "Geometric particle swarm optimization (GPSO) is a recently introduced formal generalization 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 optimization. The result is a particle swarm flying through the space of genetic programs. We present initial experimental results for our new algorithm.",
    author = "Julian Togelius and {De Nardi}, Renzo and Alberto Moraglio",
    year = "2008",
    doi = "10.1109/CEC.2008.4631284",
    language = "English (US)",
    isbn = "9781424418237",
    pages = "3594--3600",
    booktitle = "2008 IEEE Congress on Evolutionary Computation, CEC 2008",

    }

    TY - GEN

    T1 - Geometric PSO + GP = particle swarm programming

    AU - Togelius, Julian

    AU - De Nardi, Renzo

    AU - Moraglio, Alberto

    PY - 2008

    Y1 - 2008

    N2 - Geometric particle swarm optimization (GPSO) is a recently introduced formal generalization 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 optimization. The result is a particle swarm flying through the space of genetic programs. We present initial experimental results for our new algorithm.

    AB - Geometric particle swarm optimization (GPSO) is a recently introduced formal generalization 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 optimization. The result is a particle swarm flying through the space of genetic programs. We present initial experimental results for our new algorithm.

    UR - http://www.scopus.com/inward/record.url?scp=55749110379&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=55749110379&partnerID=8YFLogxK

    U2 - 10.1109/CEC.2008.4631284

    DO - 10.1109/CEC.2008.4631284

    M3 - Conference contribution

    SN - 9781424418237

    SP - 3594

    EP - 3600

    BT - 2008 IEEE Congress on Evolutionary Computation, CEC 2008

    ER -