An investigation of messy genetic algorithms

By: Nasa, National Aeronautics and Space Adm

Genetic algorithms (GAs) are search procedures based on the mechanics of natural selection and natural genetics. They combine the use of string codings or artificial chromosomes and populations with the selective and juxtapositional power of reproduction and recombination to motivate a surprisingly powerful search heuristic in many problems. Despite their empirical success, there has been a long standing objection to the use of GAs in arbitrarily difficult problems. A new approach was launched. Results to a 30-bit, order-three-deception problem were obtained using a new type of genetic algorithm called a messy genetic algorithm (mGAs). Messy genetic algorithms combine the use of variable-length strings, a two-phase selection scheme, and messy genetic operators to effect a solution to the fixed-coding problem of standard simple GAs. The results of the study of mGAs in problems with nonuniform subfunction scale and size are presented. The mGA approach is summarized, both its operation and the theory of its use. Experiments on problems of varying scale, varying building-block size, and combined varying scale and size are presented. Goldberg, David E. and Deb, Kalyanmoy and Korb, Bradley Unspecified Center NCC9-16...

• Format: Paperback
• Language: English
• ISBN: 1729094899
• ISBN13: 9781729094891
• Release Date: January 1
• Publisher: Independently Published
• Length: 36 Pages
• Weight: 0.24 lbs.
• Dimensions: 0.1" x 8.5" x 11.0"