Genetic programming: on the programming of computers by means of natural selection
Genetic programming: on the programming of computers by means of natural selection
Genetic programming II: automatic discovery of reusable programs
Genetic programming II: automatic discovery of reusable programs
Discovery of subroutines in genetic programming
Advances in genetic programming
Principles in the Evolutionary Design of Digital Circuits—Part II
Genetic Programming and Evolvable Machines
Grammatical Evolution: Evolutionary Automatic Programming in an Arbitrary Language
Grammatical Evolution: Evolutionary Automatic Programming in an Arbitrary Language
Foundations in Grammatical Evolution for Dynamic Environments
Foundations in Grammatical Evolution for Dynamic Environments
Open issues in genetic programming
Genetic Programming and Evolvable Machines
A comparison of GE and TAGE in dynamic environments
Proceedings of the 13th annual conference on Genetic and evolutionary computation
A non-destructive grammar modification approach to modularity in grammatical evolution
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Dynamic environments can speed up evolution with genetic programming
Proceedings of the 13th annual conference companion on Genetic and evolutionary computation
The Automatic Acquisition, Evolution and Reuse of Modules in Cartesian Genetic Programming
IEEE Transactions on Evolutionary Computation
Comparing methods for module identification in grammatical evolution
Proceedings of the 14th annual conference on Genetic and evolutionary computation
Hi-index | 0.00 |
Being able to exploit modularity in genetic programming (GP) is an open issue and a promising vein of research. Previous work has identified a variety of methods of finding and using modules, but little is reported on how the modules are being used in order to yield the observed performance gains. In this work, multiple methods for identifying modules are applied to some common, dynamic benchmark problems. Results show there is little difference in the performance of the approaches. However, trends in how modules are used and how "good" individuals use these modules are seen. These trends indicate that discovered modules can be used frequently and by good individuals. Further examination of the modules uncovers that useful as well as unhelpful modules are discovered and used frequently. The results suggest directions for future work in improving module manipulation via crossover and mutation and module usage in the population.