By the same authors

Evolution and acquisition of modules in Cartesian Genetic Programming

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

Author(s)

Department/unit(s)

Publication details

Title of host publicationGENETIC PROGRAMMING, PROCEEDINGS
DatePublished - 2004
Pages187-197
Number of pages11
PublisherSPRINGER-VERLAG BERLIN
Place of PublicationBERLIN
EditorsM Keijzer, UM OReilly, SM Lucas, E Costa, T Soule
Original languageEnglish
ISBN (Print)3-540-21346-5

Abstract

The paper presents for the first time automatic module acquisition and evolution within the graph based Cartesian Genetic Programming method. The method has been tested on a set of even parity problems and compared with Cartesian Genetic Programming without modules. Results are given that show that the new modular method evolves solutions up to 20 times quicker than the original non-modular method and that the speedup is more pronounced on larger problems. Analysis of some of the evolved modules shows that often they are lower order parity functions. Prospects for further improvement of the method are discussed.

    Research areas

  • NEUTRALITY, LANDSCAPE

Discover related content

Find related publications, people, projects, datasets and more using interactive charts.

View graph of relations