Professional Documents
Culture Documents
22-08-2017
Grey Wolf Optimizer (GWO)
Pengepungan Mangsa
𝐷=|𝐶
⃗ ⃗ ∙⃗ 𝑋 ( 𝑡 )|
𝑋 𝑝 (𝑡 ) − ⃗
⃗
𝑋 ( 𝑡 +1 ) =⃗
𝑋𝑝 (𝑡) − ⃗
𝐴∙⃗
𝐷
⃗ ⃗∙𝑟
𝐴=2 𝑎 ⃗1 − 𝑎
⃗
⃗ ⃗2
𝐶= 2∙ 𝑟
X * -X
(X * -X ,Y ) (X * ,Y ) (X ,Y )
(X * ,Y * )
Y*)
(X ,Y * )
(X * ,Y * -Y )
(X * -X ,Y * - Y ) (X ,Y * - Y )
(a) (b)
Perburuan Mangsa
𝐷𝛼 =|𝐶
⃗ ⃗ ∙⃗
1 𝑋 𝛼 𝑋|
− ⃗ 𝐷 𝛽=|⃗
⃗ 𝐶2 ∙ ⃗ 𝑋|
𝑋 𝛽− ⃗ 𝐷 𝛿=|⃗
⃗ 𝐶3 ∙ ⃗ 𝑋|
𝑋 𝛿 −⃗
⃗
𝑋 1= ⃗
𝑋𝛼− ⃗
𝐴1 ∙ ( 𝐷𝛼 ) ⃗
𝑋 2= ⃗
𝑋 𝛽− ⃗
𝐴2 ∙ ( 𝐷 𝛽 ) ⃗
𝑋 3= ⃗
𝑋𝛿 − ⃗
𝐴 3 ∙ ( 𝐷𝛿 )
⃗
𝑋 + ⃗
𝑋 + ⃗
𝑋3
⃗
𝑋 ( 𝑡 +1 ) = 1 2
3
α
a1
C1 β
a2
R
Estimasi C2
posisi
mangsa
Dalfa
Dbeta
Move
δ Ω atau lainnya
Ddelta
a3
C3
If |A| > 1
If |A| < 1
(a) (b)
2 2
𝑓 = 𝑥 +𝑥
1 2
5
Optimum
-8 -7 -6 -5 -4 -3 -2 -1 1 2 3 4 5 6 7 8
-1
-2
-3
-4
-5
5
G5
G1
4
2 G6
G3 Optimum
-8 -7 -6 -5 -4 -3 -2 -1 1 2 3 4 5 6 7 8
-1
G4
-2
-3
G2
-4
-5
G5
G1 β
G6
G3 Optimum
δ
G4
α
G2
G5
G1 β
Dbeta
Move
G6
Ddelta Prey
Dalfa
G3 Optimum
δ
G4
α
G2
G5
G1 β
G1 G6
Prey
G3 Dbeta Optimum
δ
G4
Ddelta Move α
Dalfa
G2
G5
G1 β
Dbeta
G1 G6
Move
Ddelta
G3 G2 Prey
δ Dalfa
G4
α
G2
G5
G1
δ
Ddelta
Prey G6
G3 Move G2 α
Dbeta Dalfa β
G4
G5
G1
δ
G3
G6
G3 G2 α
β Prey
Ddelta
Dalfa
Dbeta Move
G4
G5
Ddelta
Move
Dbeta Dalfa
G1
δ
G3 Prey
G6
G3 G2 G4 α
β
G4
G1
G5
G3 δ
G6
G2 G4 β
α
Rao Algorithms (RA)
Rao-1
𝑋 ′𝑗, 𝑘𝑖= 𝑋 𝑗 ,𝑘 , 𝑖+𝑟 1 , 𝑗 ,𝑖 ( 𝑋 𝑗, 𝑏𝑒𝑠𝑡 , 𝑖 − 𝑋 𝑗, 𝑤𝑜𝑟𝑠𝑡 ,𝑖 )
Rao-2
𝑋 𝑗 , 𝑘𝑖= 𝑋 𝑗 ,𝑘 , 𝑖+ 𝑟 1 , 𝑗 ,𝑖 ( 𝑋 𝑗 , 𝑏𝑒𝑠𝑡 , 𝑖 − 𝑋 𝑗 , 𝑤𝑜𝑟𝑠𝑡 ,𝑖 ) +𝑟 2 , 𝑗 ,𝑖 (| 𝑋 𝑗 ,𝑘 , 𝑖 or 𝑋 𝑗 ,𝑙 ,𝑖|−| 𝑋 𝑗 , 𝑙 ,𝑖 or 𝑋 𝑗 , 𝑘 ,𝑖|)
′
Rao-3
𝑋 𝑗, 𝑘𝑖= 𝑋 𝑗 ,𝑘 , 𝑖+ 𝑟 1 , 𝑗 ,𝑖 ( 𝑋 𝑗 ,𝑏𝑒𝑠𝑡 , 𝑖 −| 𝑋 𝑗 ,𝑤𝑜𝑟𝑠𝑡 , 𝑖|) +𝑟 2 , 𝑗 ,𝑖 (| 𝑋 𝑗 ,𝑘 , 𝑖 or 𝑋 𝑗 ,𝑙, 𝑖|− 𝑋 𝑗 ,𝑙 ,𝑖 or 𝑋 𝑗 ,𝑘 , 𝑖 )
′
2 2
𝑓 = 𝑥 +𝑥
1 2
5
Optimum
-8 -7 -6 -5 -4 -3 -2 -1 1 2 3 4 5 6 7 8
-1
-2
-3
-4
-5
5
R5
R1 4
2 R6
R3 Optimum
-8 -7 -6 -5 -4 -3 -2 -1 1 2 3 4 5 6 7 8
-1
R4
-2
Best
-3
R2
-4
Worst
-5
5
R5
R1 |R2|
4
Worst
R1
2 R6
R3 Optimum
-8 -7 -6 -5 -4 -3 -2 -1 1 2 3 4 5 6 7 8
-1
R4
-2
Best
-3
R2
-4
Worst
-5
R5
R1 |R2|
Worst
R1
R6
R3 Optimum
R2
R4
Best
R2
R5
R1 |R2|
Worst
R1
R6
R3 R3
R2
R4
Best
R2
R5
R1 |R2|
Worst
|R4|
R1
R6
R3 R3
R2
R4
R4
Best
R2
R5
R1 |R2|
Worst
R1
R6
R3 R3
R2
R4
R4
Best
R2
R5
R1 |R2|
Worst
R1 R6
R6
R3 R3
R2
R4
R4
Best
R2
R5
R1 R6
R3
R2
R4
R1
R5
R2 R3 R4R6
Konvergensi Prematur