A Plant Propagation Algorithm for Constrained Engineering Optimisation Problems

Algorithm 1

Pseudocode of PPA, [23].

(1) Initialization: Generate a population 𝑃={𝑋_𝑖,𝑖=1,…,NP};

(2) 𝑔←1;

(3) for  𝑔=1: 𝑔_max  do

(4)  Compute 𝑁_𝑖=𝑓(𝑋_𝑖),∀𝑋_𝑖∈𝑃;

(5)  Sort 𝑃 in ascending order of 𝑁 (for minimization);

(6)  Create new population Φ;

(7)  for each 𝑋_𝑖,𝑖=1,…,NP  do

(8)     𝛼_𝑖← set of runners where both the size of the set and the distance for each runner (individually)

      are proportional to 𝑁_𝑖, the normalized objective value

(9)     Φ← Φ∪𝛼_𝑖  {append to population};

(10) end for

(11) 𝑃←Φ  {new population};

(12) end for

(13) Return  𝑃, the population of solutions.