Research Article
A Tent Marine Predators Algorithm with Estimation Distribution Algorithm and Gaussian Random Walk for Continuous Optimization Problems
| (1) | Initialize search agents (Prey) populations | | (2) | While termination criteria are not met | | (3) | Calculate the fitness, construct the Elite matrix and accomplish memory saving | | (4) | if stagnation | | (5) | Update prey based on equation (18) | | (4) | else if rand < 0.5 | | (6) | if iter < itermax/3 | | (7) | Update prey based on equations (2) and (3) | | (8) | else if itermax/3 < iter < 2 × itermax/3 | | (9) | For the first half of the populations (i = 1, …, NP/2) | | (10) | Update prey based on equation (6) | | (11) | For the other half of the populations | | (12) | Update prey based on equation (8) | | (13) | else if iter > 2 × itermax/3 | | (14) | Update prey based on equation (10) | | (15) | end if | | (16) | else | | (17) | Update prey based on equation (17) | | (18) | Accomplish memory saving and Elite update | | (19) | end while |
|
