Scribd
Upload
4 views

Optimisation Algorithm Types and Equations (2)

The document outlines various optimization algorithms inspired by animal behaviors, categorized into four types: encircling prey, attacking from multiple dimensions, spiral behavior, and static/dynamic swarming. Each algorithm, such as Grey Wolf Optimization and Whale Optimization, includes specific equations and phases for exploration and exploitation. The document provides insights into the initialization, updating mechanisms, and behaviors that guide these algorithms in solving optimization problems.

Uploaded by

baksisrijita04
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
4 views

Optimisation Algorithm Types and Equations (2)

The document outlines various optimization algorithms inspired by animal behaviors, categorized into four types: encircling prey, attacking from multiple dimensions, spiral behavior, and static/dynamic swarming. Each algorithm, such as Grey Wolf Optimization and Whale Optimization, includes specific equations and phases for exploration and exploitation. The document provides insights into the initialization, updating mechanisms, and behaviors that guide these algorithms in solving optimization problems.

Uploaded by

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

Optimisation algorithm types and equations

Type 1:- Encircling prey behaviour:-

1. Grey wolf optimisation->


Equation:-

Note that r2 is a randomly generated vector from the interval [0,1].


HUNT:-

2. Spotted Hyena optimisation:-


Hunt:-
Exploitation and exploration:-

3.Whale optimisation algorithm


3. Whale optimisation algorithm:-

Shrinking encircling mechanism(Exploitation phase):-

This behavior is achieved by decreasing the value of a in the Eq. (2.3). Note
that the fluctuation range of A is also decreased by a. In other words A is a
random value in the interval [−a,a] where a is decreased from 2 to 0 over
the course of iterations. Setting random values for A in [−1,1], the new
position of a search agent can be defined anywhere in between the original
position of the agent and the position of the current best agent. Fig. 4(a)
shows the possible positions from (X,Y) towards (X∗,Y∗) that can be
achieved by 0≤ A ≤1 in a 2D space.
Search for prey(Exploration phase):-

Type 2:- Attacking from multiple dimensions

1. Clouded leopard optimisation:-


Initialization-

where Xi is the ith clouded leopard (i.e., candidate solution), 359 xi,j is the its
jth dimension (i.e., decision variable), N is the number of clouded leopards
(i.e., population size), m is 362 the number of decision variables, ri,j are
randomly selected numbers in the interval [0, 1].

Exploration:-
Exploitation:-

2. Fennec Fox optimisation:-


Initialization:-

Exploitation:-
Exploration:-

3. Lyrebird optimisation algorithm:-


Initialization:-
Exploration phase:-

Exploitation phase:-

Type 3:- Spiral behaviour


1. Moth-flame optimisation algorithm:-

Initialization:-

where n refers to the moths’ number and d refers to the number of


dimensions in the solution space. Also, the fitness values for all moths are
memorized in an array as follows:

Updating the moth’s position:-

Updating the number of flames:-


2. Salp optimisation algorithm:-

Initialization:-

Leader position is updated :-


3. Whale optimisation algorithm:-

Exploration phase part 2:-


Type 4:- Static and dynamic swarming behaviour (Dragonfly
optimisation algorithm – implementation of PSO):-
Separation :-

Alignment:-

Cohesion:-

Attraction:-
The attraction behaviour is :-

Distraction:-
Food gathering:

Uses PSO algorithm:-

After calculating the step vector the position vector is updated as:-

You might also like