Abstract:
Two important problems in genetic programming (GP) are its tendency to find unnecessarily large trees (bloat), and the general evolutionary algorithms problem that diversity in the population can be lost prematurely. The prevention of these problems is frequently an implicit goal of basic GP. We explore the potential of techniques from multi-objective optimization to aid GP by adding explicit objectives to avoid bloat and promote diversity. The even 3, 4, and 5-parity problems were solved efficiently compared to basic GP results from the literature. Even though only non-dominated individuals were selected and populations thus remained extremely small, appropriate diversity was maintained. The size of individuals visited during search consistently remained small, and solutions of what we believe to be the minimum size were found for the 3, 4, and 5-parity problems.
Citations
|
1170
|
Genetic algorithms in search, optimization, and machine learning
– Goldberg
- 1989
|
|
713
|
Genetic Programming
– Koza
- 1992
|
|
528
|
Genetic Programming II: automatic discovery of reusable programs
– Koza
- 1994
|
|
382
|
Genetic algorithms with sharing for multimodal function optimization
– Goldberg
- 1987
|
|
340
|
Genetic algorithms for multiobjective optimization: Formulation, discussion and generalization
– Fonseca, Fleming
- 1993
|
|
303
|
An overview of evolutionary algorithms in multiobjective optimization
– Fonseca, Fleming
- 1995
|
|
224
|
An investigation of niche and species formation in genetic function optimization
– Goldberg
- 1989
|
|
219
|
Multiobjective evolutionary algorithms: Classi cations, analyses, and new innovations
– Veldhuizen
- 1999
|
|
116
|
Complexity compression and evolution
– Nordin, Banzhaf
- 1995
|
|
109
|
Niching Methods for Genetic Algorithms
– Mahfoud
- 1995
|
|
95
|
A Sequential Niche Technique for Multimodal Function Optimisation. Evolutionary Computation, 1(2); 101-125 2. Bernad'o E, Llor`a X, Garrell J (2001) XCS and GALE: a Comparative Study of Two Learning Classifier Systems with Six Other Learning Algorithms on
– Beasley, Bull, et al.
- 1993
|
|
82
|
Genetic programming for feature discovery and image discrimination
– Tackett
- 1993
|
|
73
|
Code growth in genetic programming
– Soule, Foster, et al.
- 1996
|
|
48
|
Genetic programming and redundancy
– Blickle, Thiele
- 1994
|
|
45
|
The evolutionary induction of subroutines
– Angeline, Pollack
- 1992
|
|
34
|
An adverse interaction between crossover and restricted tree depth in genetic programming
– Gathercole, Ross
- 1996
|
|
32
|
Fitness causes bloat: Mutation
– Langdon, Poli
- 1998
|
|
28
|
Generality versus size in genetic programming
– Rosca
- 1996
|
|
22
|
Multiple Objective Optimization with Vector Evaluated Genetic Algorithms
– Schaer
- 1985
|
|
11
|
Selection based on the pareto nondomination criterion for controlling code growth in genetic programming. Genetic Programming and Evolvable Machines
– Ekárt, Németh
- 2001
|
|
8
|
Explicitly de introns and destructive crossover in genetic programming
– Nordin, Francone, et al.
- 1995
|
|
5
|
Seeding GP populations
– Langdon, Nordin
- 2000
|
|
3
|
Riolo (Eds.), Genetic programming 1996
– Koza, Goldberg, et al.
- 1996
|
|
2
|
Code growth in genetic programming. Unpublished doctoral dissertation
– Soule
- 1998
|
|
2
|
Eects of code growth and parsimony presure on populations in genetic programming
– Foster
- 1999
|
|
1
|
Computeraided control system design using a multiobjective optimization approach
– Fleming
- 1985
|
|
1
|
Advances in genetic programming 2
– Langdon
- 1996
|
|
1
|
Proceedings of the european workshop on genetic programming (Vol
– Fogarty
|
|
1
|
Unpublished doctoral dissertation, University of Illinois at Urbana-Champaign
– McPhee
- 1995
|
|
1
|
Multiobjective genetic programming: A nonlinear system identi application
– Koza
- 1997
|
