Skip to Main Content
ASME Press Select Proceedings

Intelligent Engineering Systems through Artificial Neural Networks, Volume 16

Editor
Cihan H. Dagli
Cihan H. Dagli
Search for other works by this author on:
Anna L. Buczak
Anna L. Buczak
Search for other works by this author on:
David L. Enke
David L. Enke
Search for other works by this author on:
Mark Embrechts
Mark Embrechts
Search for other works by this author on:
Okan Ersoy
Okan Ersoy
Search for other works by this author on:
ISBN-10:
0791802566
No. of Pages:
1000
Publisher:
ASME Press
Publication date:
2006

Function stacks are a directed acyclic graph representation for genetic programming that subsumes the need for automatically defined functions, substantially reduces the number of operations required to solve a problem, and permits the use of a conservative crossover operator. Function stacks are a generalization of Cartesian genetic programming. Graph based evolutionary algorithms are a method for improving evolutionary algorithm performance by imposing a connection topology on an evolutionary population to strike an efficient balance between exploration and exploration. In this study the parity problems using function stacks for parity on 3, 4, 5, and 6 variables are tested on fifteen graphical connection topologies with and without crossover. Choosing the correct graph is found to have a statistically significant impact on time to solution. The conservative crossover operator for function stacks, new in this study, is found to improve time to solution by 4–9 fold with more improvement in harder instances of the parity problem.

This content is only available via PDF.
Close Modal
This Feature Is Available To Subscribers Only

Sign In or Create an Account

Close Modal
Close Modal