GIGA is designed to propogate information through a POPULATION, using CROSSOVER as its operator. A discussion of how it propogates BUILDING BLOCKs, similar to those found in Royal Road functions by John Holland, is given in the DECEPTION section of: "Genetic Invariance: A New Paradigm for Genetic Algorithm Design." University of Alberta Technical Report TR92-02, June 1992. See also: "GIGA Program Description and Operation" University of Alberta Computing Science Technical Report TR92-06, June 1992
These can be obtained, along with the program, by FTP from ftp://ftp.cs.ualberta.ca/pub/TechReports/ in the subdirectories TR92-02/ and TR92-06/ .
Also, the paper "Mutation-Crossover Isomorphisms and the Construction of Discriminating Functions" gives a more in-depth look at the behavior of GIGA. Its is available from ftp://ftp.cs.ualberta.ca/pub/joe/Preprints/xoveriso.ps.Z
Joe Culberson, Department of Computer Science, University of Alberta, CA. Net: <joe@cs.ualberta.ca>
Mistakes in this page?
Hitch Hiker's Guide to Evolutionary Computation,
Issue 6.4, released 21 December 1998
Copyright © 1993-1998 by J. Heitkötter and
D. Beasley, all rights reserved.