Professional Documents
Culture Documents
A Combined Genetic Adaptive Search (Geneas) For Engineering Design
A Combined Genetic Adaptive Search (Geneas) For Engineering Design
A Combined Genetic Adaptive Search (Geneas) For Engineering Design
Reviewed by
Paskorn Champrasert
paskorn@cs.umb.edu
http://dssg.cs.umb.edu
Outline
• Introduction
• Genetic Operations
– Crossover (Binary Crossover, SBX Crossover)
– Mutation
• GeneAS Algorithms
• Experiment Results
• Conclusion
• The variable
vector X
represents a set
of variables.
xi , i = 1, 2, , N
October 24, 08 DSSG Group Meeting 3/31
A Simple Cantilever beam design problem:
• A cantilever beam is a beam that is rigidly supported at
one end and carries a certain load on the other end.
Design possibilities:
- Shape (circular or square)
Æ binary design variable (0/1)
- Size
Diameter of circular shape
Side of square shape
Æ discrete variable
because size are not available in any sizes
- Length
Æ real variable
because we can cut beams at any length
- Material
Æ discrete variable
(cast iron, aluminum, steel, brass)
October 24, 08 DSSG Group Meeting 4/31
Research Issues
• The optimization problem is involving with different types of
variables.
E.g.,
- For the material variable
if the steel is represented as 1 and cast iron is represented as 2,
no intermediate value (e.g., 1.4 ) is allowed.
Æ binary-coded variable should be used.
- For the beam length variable (0-100)
if the length is represented by using 4 bit binary-coded variable
(0000-1111). The precision of the variable is only 100/16 = 6.25
no more precise value (e.g., 2.5) is allowed
Æ real-coded variable should be used.
• Designers must rely on an optimization algorithms which is
flexible enough to handle a mixed type of variables
Binary Mutation
1 1 1 0
Each bit of offspring has a probability
1 1 0 0 (mutation rate) to flip (0 Æ1 or 1Æ0)
1 0 0 1 9
Average = 11.5
1 1 1 0 14
1 0 1 0 10
Average = 11.5
1 1 0 1 13
c1 = x̄ − 12 β(p2 − p1 ) β<1 p1 p2
c2 = x̄ + 12 β(p2 − p1 )
c1 c2
By, β>1
1
x̄ = 2 (p1
+ p2 ) p1 p2
p2 > p1
c1 c2
So,
β=1 p1 p2
c̄ = x̄
October 24, 08 DSSG Group Meeting 15/31
Spread Factor (β) in SBX
• The probability distribution of β in SBX should be similar (e.g.
same shape) to the probability distribution of β in Binary-coded
crossover.
• This paper proposed probability c(β) = 0.5(n + 1)β n , β ≤ 1
distribution function as: 1
c(β) = 0.5(n + 1) β n+2 ,β > 1
1.6
1.4
Probability Distribution
1.2
1.0 n=2
0.8
0.6
0.4
0.2
0.0
0 1 2 3 4 5 6 7
β
expanding
1
c(β) = 0.5(n + 1) β n+2 ,β > 1
Mostly, n=2 to 5
October 24, 08 DSSG Group Meeting 17/31
Spread Factor (β) as a random number
• β is a random number that follows the proposed
probability distribution function:
1.6
1.4
To get a β value,
Probability Distribution
1.2
1) A unified random number u
n=2
is generated [0,1]
1.0
0.8
0.6 2) Get β value that makes the
0.4
0.2
area under the curve = u
0.0
u
0 1 2 3 4 5 6 7
β Offspring:
β
c1 = x̄ − 12 β(p2 − p1 )
c2 = x̄ + 12 β(p2 − p1 )
October 24, 08 DSSG Group Meeting 18/31
Real Mutation
• Mutation probability (pm) in (0,1) is applied to each
variable.
• For each variable
If a unified random number um in (0,1) < pm
mutation operator is performed for the variable.
p: parent
c: offspring
g1(x) =380.1660
g2(x) =402.0473
g3(x) = 0.2346
g4(x) = 0.1621
F(x) =1.9622
x1 x2
α(x2-x1) α(x2-x1)