0% found this document useful (0 votes)
12 views

Question3 AI

The document discusses initializing 5 particles for particle swarm optimization between 0.1 and 0.9 to solve an optimization problem where the optimal solution is zero. It then has the reader compute the fitness of each particle using the function x^2 + x + 1, sort the particles by fitness, and update the velocity and position of each particle where w=0.7, C1=C2=1.4, and rand1 and rand2 are both 1.

Uploaded by

Danish Raja
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
12 views

Question3 AI

The document discusses initializing 5 particles for particle swarm optimization between 0.1 and 0.9 to solve an optimization problem where the optimal solution is zero. It then has the reader compute the fitness of each particle using the function x^2 + x + 1, sort the particles by fitness, and update the velocity and position of each particle where w=0.7, C1=C2=1.4, and rand1 and rand2 are both 1.

Uploaded by

Danish Raja
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Question:

Consider following particles for particle swarm optimization to solve optimization problem where
optimal solution is on zero. Initialize velocities values as per your choice within the range of 0.1 to
0.9
P1=0.2
P2=0.5
P3=.34
P4=.45
P5=0.48
a) Compute the fitness of above particles using X2 +X +1 functions, sort out the particle based on
fitness, most optimal particle should be on top of the list.
b) Update velocity and position of each particle where w=0.7, C 1=C2=1.4, rand1=1, rand2=1

Expert Answer

The outcome of PSO after the first iteration is shown in the above table, PSO will iterate multiple times in a
similar way to find the optimal solution.

You might also like