CMU Artificial Intelligence Repository
mGA: C and Common Lisp implementations of a messy GA
This directory contains mGA1.0. mGA is a C implementation
of a messy GA as described in TCGA report No. 91008. Messy GAs
overcome the linkage problem of simple genetic algorithms by combining
variable-length strings, GENE expression, messy operators, and a
nonhomogeneous phasing of evolutionary processing. Results on a
number of difficult deceptive test functions have been encouraging
with the messy GA always finding global optima in a polynomial number
of function evaluations.
A Common Lisp version, as documented in TCGA report No. 90004, is
Version: 1.1 (23-JUN-94)
Requires: C, Common Lisp
Ports: Lisp version runs under KCL.
Updated: Tue Nov 8 17:18:31 1994
CD-ROM: Prime Time Freeware for AI, Issue 1-1
Author(s): Kalyanmoy Deb
David E. Goldberg, T. Kerzic
Contact: For hardcopies of the technical reports
Eric Thompson, IlliGAL Librarian
Department of General Engineering
117 Transportation Building
104 South Mathews Avenue
Urbana, IL 61801-2996 USA
Authors!Deb, Authors!Goldberg, Authors!Kerzic, C!Code,
Genetic Algorithms, Lisp!Code, Messy GA, Univ. of Alabama,
See TCGA reports 89003, 90004, 90005, 90006, and 91004 for more information
on messy GAs.
Kalyanmoy Deb and David E. Goldberg, "mGA in C: A Messy Genetic
Algorithm in C", IlliGAL Technical Report 91008, September 1991.
David E. Goldberg and T. Kerzic, "mGA 1.0: A Common Lisp
Implementation of a Messy Genetic Algorithm" TCGA Report No. 90004,
Last Web update on Mon Feb 13 10:23:05 1995