Scribd
Upload
5 views11 pages

Week 11

Uploaded by

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

Week 11

Uploaded by

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

Advanced Operators and Techniques

in Genetic
Algorithm
Lecture Week 4

DR. SAIF ULLAH


Inversion and reordering,
PMX,
OX,
Combinatorial optimization
Inversion and reordering,
Inversion is a unary, reordering genetic
operator. Simple genetic algorithms use
stochastic selection, 1-point cross over, and
mutation to increase the number of building
blocks in the population and to recombine
them for even better building blocks.
Inversion operator is a primary natural
mechanism to recode a problem. In inversion
operator, two points are selected along the
length of the chromosome, the chromosome is
cut at those points and the end points of the
section cut, gets reversed (switched, swapped).
Partially Matched Crossover
In Partially Matched Crossover, two strings
are aligned, and two crossover points are
selected uniformly at random along the
length of the strings.
The two crossover points give a matching
selection, which is used to affect a cross
through positionby-position exchange
operations.
Two crossover points were selected at
random, and PMX proceeds by position
wise exchanges.
In-between the crossover points the genes
get exchanged i.e., the 3 and the 2, the 6
and the 7, the 5 and the 9 exchange
places.
This is by mapping parent B to parent A.
Now mapping parent A to parent B, the 7
and the 6, the 9 and the 5, the 2 and the 3
exchange places.
Each offspring contains ordering
information partially determined by each of
its parents. PMX can be applied to problems
with permutation representation.
Order Crossover
The order crossover begins in a manner
similar to PMX. But instead of using point
by-point exchanges as PMX does, order
crossover applies sliding motion to fill the
left out holes by transferring the mapped
positions.
Combinatorial
Optimizations
To determine a permutation of some items
associated with the problem.
 To determine a combination of some items.
 To determine both permutation and
combination of some items.
Any one of the above subject to
constraints.

You might also like