An Introduction to Genetic Algorithms - Boente
An Introduction to Genetic Algorithms - Boente
An Introduction to Genetic Algorithms - Boente
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
To address the finite−population case, Nix and Vose (1991) modeled the simple GA as a Markov chain.<br />
Markov chains are s<strong>to</strong>chastic processes in which the probability that the process will be in state j at time t<br />
depends only on the state i at time t 1. Many processes in nature can be described as Markov chains. (For an<br />
introduction <strong>to</strong> the mathematics of Markov chains see Feller 1968.)<br />
A "state" of a finite−population GA is simply a particular finite population. The set of all states is the set of<br />
possible populations of size n. These can be enumerated in some canonical order and indexed by i. Nix and<br />
Vose represent the ith such population as a vec<strong>to</strong>r of length 2 l . The yth element of is the number of<br />
occurrences of string y in population Pi. It is clear that under the simple GA the current population Pj depends<br />
(s<strong>to</strong>chastically) only on the population at the previous generation. Thus, the GA can be modeled as a Markov<br />
chain.<br />
To construct such a model, we need <strong>to</strong> write down the probability of going from any given population <strong>to</strong> any<br />
other under the simple GA. The set of all possible populations of size n can be represented by a giant matrix,<br />
Z, in which the columns are all possible population vec<strong>to</strong>rs . How many possible populations of size n are<br />
there? The answer is<br />
(Deriving this is left as an exercise.) A given element Zy,i of Z is the number of occurrences of string y in<br />
population i.<br />
Here is a simple example of constructing the Z matrix: Let l = 2 and n = 2. The possible populations are<br />
The array Z is<br />
Chapter 4: Theoretical Foundations of <strong>Genetic</strong> <strong>Algorithms</strong><br />
A state for the Markov chain corresponds <strong>to</strong> a column of Z.<br />
The next step is <strong>to</strong> set up a Markov transition matrix Q.Q is an N × N matrix, and each element Qi,j is the<br />
probability that population Pj will be produced from population Pi under the simple GA. Once this matrix is<br />
defined, it can be used <strong>to</strong> derive some properties of the GA's behavior.<br />
Writing down the transition probabilities QI,j is a bit complicated but instructive. Let pi(y) be the probability<br />
that string y will be generated from the selection and recombination process (i.e., steps 3 and 4) of the simple<br />
GA acting on population Pi. The number of occurrences of string y in population Pj is Zy,j, so the probability<br />
that the correct number comes from population Pi is simply the probability that Zy,j occurrences of y are<br />
produced from population Pi. This is equal <strong>to</strong> the probability that y is produced on Zy,j different<br />
selection−and−recombination steps times the number of ways in which these Zy,j different<br />
selection−and−recombination steps can occur during the <strong>to</strong>tal n selection−and−reproduction steps. Following<br />
109