Review Article
A Comprehensive Survey on Particle Swarm Optimization Algorithm and Its Applications
Step 1. Initialization | For each particle , do | (a) Initialize the particle’s position with a uniformly distribution as (0)~U(LB, UB), where LB and UB represent the lower | and upper bounds of the search space | (b) Initialize to its initial position: . | (c) Initialize to the minimal value of the swarm: . | (d) Initialize velocity: . | Step 2. Repeat until a termination criteria is met | For each particle , do | (a) Pick random numbers: . | (b) Update particle’s velocity. See formula (2). | (c) Update particle’s position. See formula (3). | (d) If , do | (i) Update the best known position of particle : . | (ii) If , update the swarm’s best known position: . | (e) ; | Step 3. Output that holds the best found solution. |
|