Research Article
An Efficient Algorithm for Unconstrained Optimization
(1) Begin. | (2) while Termination criterion is not satisfied do | (3) Create a population of particles distributed in the feasible space. | (4) Evaluate each position of the particles according to the objective function (fitness function). | (5) If the current position of a particle is better than the previous one, update it. | (6) Determine the best particle (according to the best previous positions). | (7) Update the particle velocities according to (4). | (8) Move the particles to new positions according to (3). | (9) end |
|