Searching for diverse, cooperative populations with genetic algorithms.pdfVIP

Searching for Diverse, Cooperative Populations with Genetic Algorithms Robert E. Smith Stephanie Forrest Alan S. Perelson Dept. of Engin. Mechanics Dept. of Computer Science Theoretical Division University of Alabama University of New Mexico Los Alamos National Laboratory Tuscaloosa, AL 35487 Albuquerque, NM 87131 Los Alamos, NM 87545 (205) 348-1618 (505) 277-7104 (505) 667-6829 resmith@ua1ix.ua.edu forrest@cs.unm.edu asp@receptor.lanl.gov Running Head: Cooperative Populations with GAs Keywords: genetic algorithms, classifier systems, fitness sharing, computational immunology, multi-modal search Abstract In typical applications, genetic algorithms (GAs) process populations of potential problem solutions to evolve a single population member that specifies an “optimized” solution. The majority of GA analysis has focused on these optimization applications. In other applications (notably learning classifier systems and certain connectionist learning systems), a GA searches for a population of cooperative structures that jointly perform a computational task. This paper presents an analysis of this type of GA problem. The analysis considers a simplified genetics-based machine learning system: a model of an immune system. In this model, a GA must discover a set of pattern-matching antibodies that effectively match a set of antigen patterns. Analysis shows how a GA can automatically evolve and sustain a diverse, cooperative population. The cooperation emerges as a natural part of the antigen-antibody matching