Genetic programming II: automatic discovery of reusable programs
Genetic programming II: automatic discovery of reusable programs
Advances in genetic programming
Advances in genetic programming
Hi-index | 0.01 |
The goal of this paper is to show that population size can be reduced by introducing different architectures (Automatic function Definition) in the initial population and the process of learning can be speeded up by having a separate sub-population for each automatic function. This provides the desired solutions of smaller sizes and also finds an effective way of scaling up the problem. A Standard Genetic programming. Genetic Programming with Automatic function defined functions (ADF) and Genetic Programming (with sub-population for each ADF) is implemented on 11-Multiplexer problem.