Genetic Operators and Schemata Effect of Genetic Operators on a Schema, — Reproduction: Helps more fit chromosomes, subsequently, schemata with higher fitness survive. — Crossover destroys long patterns, sustains short schemas. — Mutation destroys long patterns, sustains short schemas — Consider 1***0 and **11* Building Blocks of GA: are the highly fit short-defining schemas Implicit Parallelism: For every n function evaluation, approximately n*3 schemas are processed. * Schema Theorem (The Fundamental Theorem of GA): — Short, low order, above average schemata receive exponentially increasing trias in subsequent generations. The Fundamental Theorem of GA ae OH aa — pyO) mA k+1)= mH, k) ae © Where er - Fitness of individual ° HH -Schema © m ~~ Number of Schemata * 8 - Defining length © 0 -Order © Pp. — - Crossover Probabilitybe = Me * Pa - Mutation Probability vol - String Length . Le. Short Low Order Schemata Grow Logistically, © Call them Building Blocks. Dual Representations and Competing Conventions * — When the interpretation function is not one-to-one, i.e. such that two or more genotypes may map into one phenotype, _ the problem of dual/multi representation and competing conventions arises. * — Insuch situations, a crossover between two good phenotypes, belonging to two different conventions, is unlikely to yield an improved solutions. . This is particularly true of fuzzy systems. Types of GA The central goal of the research effort in genetic algorithms is to find a form of algorithm that is robust. ° Standard GA Steady State GA: Instead of first making an intermediate population, and only then applying the genetic operators, the genetic operators are applied directly to members of current population. These members are chosen at random based on their fitness. The newly made chromosomes are then merged nto the current population, taking the place of a ‘doomed’ chromosome. — Advantages: Required less memory, Notion of age can be built such that after several generations, a chromosome cannot be reselected to create new offsprings. Incremental GA: evaluates only one individual in each generation. — Advantages: Real-time applicability, much less memory — Disadvantages: Only one individual may not find optimal solution. 2IPage