Scribd
Upload
12 views9 pages

Evolutionary Computation (I)

Uploaded by

micheal amash
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
12 views9 pages

Evolutionary Computation (I)

Uploaded by

micheal amash
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 9

Evolutionary computation (I)

Introduction, or can evolution be intelligent?

Intelligence can be defined as the capability of a system to


adapt its behaviour to an ever-changing environment.

By modelling the process of evolution, we might expect to


create intelligent behaviour.

1
Evolutionary computation (I)

Evolutionary computation, an umbrella term that combines


genetic algorithms, evolution strategies and genetic
programming.

All these techniques simulate evolution by using the processes


of selection, mutation and reproduction.

2
Evolutionary computation (I)
Can we simulate the process of natural evolution in a
computer?
In the early 1970s, John Holland, one of the founders of
evolutionary computation, introduced the concept of genetic
algorithms. His aim was to make computers do what nature
does.

Nature has an ability to adapt and learn without being told what
to do. In other words, nature finds good chromosomes blindly.
GAs do the same.

3
Evolutionary computation (I)
Genetic algorithms
Genetic algorithms are a class of stochastic search algorithms
based on biological evolution.

A GA applies the following major steps:

Step 1: Represent the problem variable domain as a


chromosome of a fixed length, choose the size of a
chromosome population N, the crossover
probability pc and the mutation probability pm.

4
Evolutionary computation (I)
Step 2: Define a fitness function to measure the performance,
or fitness, of an individual chromosome in the problem domain.
The fitness function establishes the basis for selecting
chromosomes that will be mated during reproduction.

Step 3: Randomly generate an initial population of


chromosomes of size N:
x1; x2; . . . ; xN

5
Evolutionary computation (I)
Step 4: Calculate the fitness of each individual chromosome:
f (x1); f(x2); . . . ; f (xN)

Step 5: Select a pair of chromosomes for mating from the


current population. Parent chromosomes are selected with a
probability related to their fitness. Highly fit chromosomes
have a higher probability of being selected for mating than less
fit chromosomes.

Step 6: Create a pair of offspring chromosomes by applying the


genetic operators – crossover and mutation.
6
Evolutionary computation (I)
Step 7: Place the created offspring chromosomes in the new
population.

Step 8: Repeat Step 5 until the size of the new chromosome


population becomes equal to the size of the initial population,
N.

Step 9: Replace the initial (parent) chromosome population


with the new (offspring) population.

7
Evolutionary computation (I)
Step 10: Go to Step 4, and repeat the process until the
termination criterion is satisfied.

As we see, a GA represents an iterative process. Each iteration


is called a generation. A typical number of generations for a
simple GA can range from 50 to over 500. The entire set of
generations is called a run.

At the end of a run, we expect to find one or more highly fit


chromosomes.

8
Evolutionary computation (I)
Are any conventional termination criteria used in genetic
algorithms?
Because GAs use a stochastic search method, the fitness of a
population may remain stable for a number of generations
before a superior chromosome appears. This makes applying
conventional termination criteria problematic.

A common practice is to terminate a GA after a specified


number of generations and then examine the best chromosomes
in the population. If no satisfactory solution is found, the GA is
restarted.
9

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy