CMU Artificial Intelligence Repository
Home INFO Search FAQs Repository Root

Beginners Guide to GAs

areas/genetic/ga/doc/intro/overview/
This directory contains two introductions to genetic algorithms written by David Beasley. They are suitable for beginners and include many references. 
Origin:   

   ralph.cm.cf.ac.uk:/pub/GAs/ (Europe)
   as the files ga_overview1.ps and ga_overview2.ps
   sfi.santafe.edu:/pub/EC/GA/papers (elsewhere)
   as the files over93.ps.gz and over93-2.ps.gz
CD-ROM: Prime Time Freeware for AI, Issue 1-1 Author(s): David Beasley Department of Computing Mathematics University of Wales College of Cardiff PO Box 916, CARDIFF CF2 4YN, UK Keywords: Authors!Beasley, Genetic Algorithms!Introductions References: An Overview of Genetic Algorithms: Part 1, Fundamentals David Beasley, David R. Bull, Ralph R. Martin. University Computing, 15(2) 58-69, 1993. [Suitable for beginners. Describes all the basic principles, and includes a comparison with other search methods. 49 references.] An Overview of Genetic Algorithms: Part 2, Research Topics David Beasley, David R. Bull, Ralph R. Martin. University Computing, 15(4) 170-181, 1993. [Suitable for beginners and intermediates. Includes sections on crossover, reordering, epistasis, deception, naive evolution, non-binary representations, dynamic operator probabilities, niching, diploidy, and heuristics. 70 references.]
Last Web update on Mon Feb 13 10:22:39 1995
AI.Repository@cs.cmu.edu