Research Article
A Hybrid Search Model for Constrained Optimization
| Input: Entire population . | | Output: Updated subpopulation . | (1) | Divide the population into K subpopulations by Algorithm 2 | (2) | Calculate the direction vectors by Algorithm 7; | (3) | for do | (4) | Set ; | (5) | Generate offspring by Algorithm 4; | (6) | Select the direction vector corresponding to ; | (7) | for do | (8) | if then | (9) | ; | (10) | else | (11) | ; | (12) | end if | (13) | end for | (14) | end for |
|