Research Article
A Species Conservation-Based Particle Swarm Optimization with Local Search for Dynamic Optimization Problems
Algorithm 1
Pseudocode of the canonical PSO algorithm.
(1) | Randomly initialize particles of population within the problem’s search space; | (2) | Evaluate each individual in ; | (3) | for eachdo | (4) | ; | (5) | end for | (6) | Find the global best particle ; | (7) | while termination condition is not reached do | (8) | Apply equation (2) to update each particle’s velocity; | (9) | Apply equation (3) to update each particle’s location; | (10) | Calculate the fitness value of ; | (11) | if is better than | (12) | ; | (13) | end if | (14) | if is better than | (15) | ; | (16) | end if | (17) | end while |
|