A Framework for Constrained Optimization Problems Based on a Modified Particle Swarm Optimization

Algorithm 1

The framework of applying SASPSO 2011 for solving COPs.

(1)    Set simulation parameters and randomly generate an initial swarm

(2)   Obtain , and at the initial iteration

(3)   while    do

(4)     % set the number of feasible solutions to be 0

(5)   for    do

(6)       % calculate center of

(7)   Randomly generate within the hypersphere

(8)     % update velocity of particle

(9)     % update position of particle

(10)   Modify each dimension of by the saturation strategy given by (48)

(11)       % calculate constraint violation

()    if    do

()   Particle   is feasible and  

()    else

()   Particle   is non-feasible and  

()    end if

()   Calculate fitness value of particle  

()   Update the personal best position of particle   by the feasibility-based rule

()    end for

()    Update the global best position of the swarm by the feasibility-based rule

()  for    do

()       % update

()       % update

()       % update

()  end for

(       % update the relaxation value

()   

() end while

() Output