Transmission function models of infinite population genetic algorithms
C.H.M. vanKemenade, Jonathan Kok, J.A. Poutré, Dirk Thierens · 1998
The so-called transmission function framework is described, and implementations of transmission function models are given for a broad range of genetic algorithms. These models describe GA's with a population of infinite size. An actual implementation of these models for a non-trivial problem involving deception is given, these models are traced, and the results are visualized by means of population flow diagrams. These diagrams show that cross-competition between di#erent parts of the optimal solution takes place. 1991 Mathematics Subject Classification: 68T05, 68T20 1991 Computing Reviews Classification System: F.2.m, G.1.6, I.2.8 Keywords and Phrases: genetic algorithms, selection schemes, transmission functions, tracing models Note: Work carried out under theme SEN4 "Evolutionary Computation". 1. Introduction Altenberg used transmission functions to model generational genetic algorithms [Alt94]. We have extended these transmission function models to a broad range of geneti...