Fully Distributed Cartesian Genetic Programming

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

@InProceedings{bremer:2022:PAAMS,

• author = "Joerg Bremer and Sebastian Lehnhoff",
• title = "Fully Distributed Cartesian Genetic Programming",
• booktitle = "Advances in Practical Applications of Agents, Multi-Agent Systems, and Complex Systems Simulation. The PAAMS Collection",
• year = "2022",
• editor = "Frank Dignum and Philippe Mathieu and Juan Manuel Corchado and Fernando {De La Prieta}",
• volume = "13616",
• series = "LNAI",
• pages = "36--49",
• publisher = "Springer",
• keywords = "genetic algorithms, genetic programming, Cartesian Genetic Programming, parallel computing, Multi-agent system, COHDA, Distributed optimization",
• isbn13 = "978-3-031-18192-4",
• URL = "https://rdcu.be/c7nZL",
• URL = "http://link.springer.com/chapter/10.1007/978-3-031-18192-4_4",
• DOI = "doi:10.1007/978-3-031-18192-4_4",
• size = "14 pages",
• abstract = "Cartesian genetic programming is a popular version of genetic programming and has meanwhile proven its performance in many use cases. This paper introduces an algorithmic level decomposition of program evolution that can be solved by a multi-agent system in a fully distributed manner. A heuristic for distributed combinatorial problem solving is adapted to evolve programs. The applicability of the approach and the effectiveness of the multi-agent approach as well as of the evolved genetic programs are demonstrated using symbolic regression, n-parity, and classification problems.",

}

Genetic Programming entries for Joerg Bremer Sebastian Lehnhoff

Citations