A Non-Linear Schema Theorem for Genetic Algorithms

We generalize Holland's Schema Theorem to the setting that genes are arranged, not necessarily in a linear sequence, but as the nodes in a connected graph. We have experimental results showing that the flourishing of building blocks can be expected for two distinct graphs we have investigated, one being a tree and the other being the lattice points in a cube in Euclidean 3-space.

• Type: Conference
• Year: 2000
• Where: GECCO
• Authors: William A. Greene
• Keywords: Connected Graph, GECCO 2000, Holland's Schema Theorem, Linear Sequence, Optimization