A Hybrid Dynamic Probability Mutation Particle Swarm Optimization for Engineering Structure Design

Algorithm 1

Pseudocode of the CWDEPSO algorithm.

(1)	Step 1: initialization
(2)	Parameter initialization:
(3)	Generate initial population:
(4)	Find the initial and of the population
(5)	Step 2: update parameters
(6)	While
(7)	Update the inertia weights adopting equation (14)
(8)	Update the social component and the cognitive component using equations (15) and (16)
(9)	Calculate and of each particle using equations (17) and (20)
(10)	Update the probability using equation (26)
(11)	Step 3: finding the optimal value through iteration
(12)	For do
(13)	Update the velocity adopting equation (1)
(14)	Using equation (2) to update the position of the particle
(15)	End For
(16)	If
(17)	For do
(18)	Mutation operation using equation (23)
(19)	Crossover and boundary processing using equations (10) and (11), respectively
(20)	Using equations (12) and (28) to get and
(21)	Update parameters and using equations (18) and (21), respectively
(22)	End For
(23)	Select the better one between the worst of and the best of
(24)	Update and
(25)	Else
(26)	Calculate the fitness of particles in the population and update and
(27)	End If
(28)	If failed to update
(29)	flag bit
(30)	Else
(31)
(32)	End If
(33)	If flag bit > warning value
(34)	Choose whether to initialize the particle using equation (27)
(35)	End If
(36)	If flag bits of all particles
(37)	number of failures
(38)	End If
(39)
(40)	Step 4: output result
(41)	End While