Research Article
Whale Optimization Algorithm for Multiconstraint Second-Order Stochastic Dominance Portfolio Optimization
Algorithm 1
The main procedure of WOA.
(1) | Initialize the whale’s population | (2) | Calculate the fitness of each search agent | (3) | = the best search agent | (4) | while t < maximum number of iterations do | (5) | return the out-of-bounds search agent to the boundary | (6) | for each search agent do | (7) | Update , , , , and | (8) | ifandthen | (9) | Update the position of the current search agent by using (21) | (10) | else ifandthen | (11) | Select a random search agent () | (12) | Update the position of the current search agent by using (24) | (13) | else ifthen | (14) | Update the position of the current search by using (26) | (15) | end if | (16) | end for | (17) | Check if any search agent goes beyond the search space and amend it | (18) | Calculate the fitness of each search agent | (19) | Update if there is a better solution | (20) | t = t + 1 | (21) | end while | (22) | return |
|