Modularity in Genetic Programming

1Citations
Citations of this article
23Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This chapter provides a review of methods for automatic modularization of programs evolved using genetic programming. We discuss several techniques used to establishing modularity in program evolution, including highly randomized techniques, techniques with beforehand specified structure of modules, techniques with evolvable structure and techniques with heuristic identification of modules. At first, simple techniques such as Encapsulation and Module Acquisition are discussed. The next two parts reviews Automatically Defined Functions and Automatically Defined Functions with Architecture Altering Operations that enable to evolve the structure of modules at the same time of evolving the modules itself. The following section is focused on Adaptive Representation through Learning, a technique with heuristic-based identification of modules. Next, Hierarchical Genetic Programming is described. Finally, establishing recursion and iteration, a code reuse technique closely related to modularization, is briefly surveyed. © Springer-Verlag Berlin Heidelberg 2013.

Cite

CITATION STYLE

APA

Dostál, M. (2013). Modularity in Genetic Programming. Intelligent Systems Reference Library. https://doi.org/10.1007/978-3-642-30504-7_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free