Scribd
Upload
41 views

AI Assignment #4 049

The document discusses the Dragonfly Algorithm, which is a nature-inspired optimization algorithm modeled after the swarming behavior of dragonflies. It summarizes the methodology of the Dragonfly Algorithm in 3 steps: (1) Initialization of candidate solutions analogous to dragonflies, (2) Calculation of a step vector based on behaviors like separation, alignment, and cohesion to update dragonfly positions, and (3) Repeated iteration of steps 2-8 until a termination criterion is met. The algorithm is particularly effective for complex, non-linear problems and has been applied in engineering, economics, and data mining.

Uploaded by

Daniyal Hamid
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
41 views

AI Assignment #4 049

The document discusses the Dragonfly Algorithm, which is a nature-inspired optimization algorithm modeled after the swarming behavior of dragonflies. It summarizes the methodology of the Dragonfly Algorithm in 3 steps: (1) Initialization of candidate solutions analogous to dragonflies, (2) Calculation of a step vector based on behaviors like separation, alignment, and cohesion to update dragonfly positions, and (3) Repeated iteration of steps 2-8 until a termination criterion is met. The algorithm is particularly effective for complex, non-linear problems and has been applied in engineering, economics, and data mining.

Uploaded by

Daniyal Hamid
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/ 4

Artificial Intelligence

ASSIGNMENT#04

Student Name Fatima Batool

FA21-BEE-049
Registration Number

BEE-5B
Class/Section

Instructor’s Name Dr. Dilshad Shabir

1
Question # 01:

Write the methodology of following searching algorithms as per table below.

DRAGON FLY ALGORITHM:


The Dragonfly Algorithm is a nature-inspired
optimization algorithm that models the static and dynamic swarming behaviors of
dragonflies in nature. This algorithm is used for solving optimization problems and is
particularly effective in dealing with complex, non-linear, and multi-modal functions.

Here is a general overview of the methodology of the Dragonfly Algorithm:

Initialization:
The algorithm begins by creating a population of candidate solutions,
which are analogous to dragonflies in nature. Each dragonfly represents a potential
solution to the optimization problem, and its position in the search space represents a
particular set of decision variables.

Separation:
This behavior prevents dragonflies from colliding with each other. In the
algorithm, it ensures that candidate solutions do not converge too quickly or get stuck
in local optima.

Alignment:
This behavior causes dragonflies to align their direction and velocity
with neighboring dragonflies. In the algorithm, this encourages the movement of
solutions towards regions of the search space where other promising solutions have
been found.

2
Cohesion:
This behavior leads to the attraction of dragonflies towards each other,
promoting the exploration of the search space more effectively. In the algorithm, it
helps in maintaining the diversity of the solutions.

Attraction to Food and Distraction by Enemies:


In nature, dragonflies are attracted
to food sources and distracted by enemies. In the algorithm, these behaviors are
simulated by attraction to the best solution found so far (food) and diversion from the
worst solution (enemy). This guides the exploration and exploitation processes.

Step Vector:
A step vector is calculated based on the behaviors mentioned above.
This vector determines the direction and distance each dragonfly (solution) will move
in the next iteration.

Update Position:
The positions of the dragonflies are updated based on the step vector.
This step simulates the dynamic swarming behavior of dragonflies.

Evaluation:
Each new position of a dragonfly is evaluated using the objective function
of the optimization problem. The fitness of each solution determines its quality.

Iteration:
Steps from 2 to 8 are repeated for a set number of iterations or until a
convergence criterion is met. Over iterations, the algorithm progressively refines the
solutions, ideally converging towards the global optimum.

Termination:
The algorithm terminates when a stopping criterion is met, which could
be a maximum number of iterations, a satisfactory solution quality, or no significant
improvement over a number of iterations.

3
FLOWCHART OF DRAGONFLY ALGORITHM:

CONCLUSION:
The Dragonfly Algorithm is particularly known for its simplicity,
ease of implementation, and ability to effectively navigate complex, multimodal
landscapes in the search space. It has been applied successfully in various domains,
including engineering, economics, and data mining.

You might also like