DocumentCode
2731986
Title
Fitness evaluation avoidance in Boolean GP problems
Author
Jackson, David
Author_Institution
Dept. of Comput. Sci., Liverpool Univ., UK
Volume
3
fYear
2005
fDate
2-5 Sept. 2005
Firstpage
2530
Abstract
A technique has been devised which, via consideration of the program nodes executed during fitness evaluation, allows a genetic programming system to determine many instances in which invocation of the fitness function can be avoided. The nature of Boolean logic problems renders them of particular interest as a focus of study for the application of this technique, and experimental evidence shows that significant speed-ups in execution time can be achieved when evolving solutions to these problems.
Keywords
Boolean algebra; genetic algorithms; Boolean GP problems; Boolean logic problems; fitness evaluation avoidance; fitness function; genetic programming system; program nodes; Boolean functions; Computer science; Data structures; Genetic mutations; Genetic programming; Logic programming; Testing;
fLanguage
English
Publisher
ieee
Conference_Titel
Evolutionary Computation, 2005. The 2005 IEEE Congress on
Print_ISBN
0-7803-9363-5
Type
conf
DOI
10.1109/CEC.2005.1555011
Filename
1555011
Link To Document