|
Algorithm 1. Multi Strategy Differentiated Creative Search (MSDCS) |
| 1: Initialization: Xi(i = 1, 2, 3, …, NP), FEs = 0, FEsmax
|
| 2: Evaluate the fitness values of the initial population X
|
| 3: while (FEs < FEsmax) do |
| 4: Calculate of each individual using Equation (12)//PES
|
| 5: Sort the population in ascending order of
|
| 6: for every individual, do |
| 7: Calculate the and using Equations (2) and (3) |
| 8: Randomly select using Equation (5) |
| 9: if i == N
|
| 10: Update the using Equation (9) |
| 11: else if
|
| 12: Update the using Equation (8) |
| 13: else |
| 14: Update the using Equation (6) |
| 15: end if |
| 16: Update the Xnewi using Equation (4) |
| 17: FEs = Fes + 1 |
| 18: end for |
| 19: Calculate and using Equations (14) and (15)//CDM
|
| 20: Generate new individuals using Equation (16)//CDM
|
| 21: FEs = Fes + Nc
|
| 22: Calculate the Nnew using Equation (13)//LPSR
|
| 23: Shrinking X by discarding the worst solutions |
| 24: end while |
| 25: Return best individual |