Research Article
Deep-Mining Backtracking Search Optimization Algorithm Guided by Collective Wisdom
Algorithm 1
The pseudocode of MBSAgC.
| Input: | | Output: Globalminimum | (1) | % is the maximum number of iterations. Globalminimum records the current minimum. | (2) | % Initialization process of P and | (3) | for do | (4) | for do | (5) | | (6) | end | (7) | end | (8) | for do | (9) | % Topological opposition-based learning (TOBL) | (10) | for do | (11) | for do | (12) | | (13) | if then | (14) | | (15) | end | (16) | end | (17) | end | (18) | % Selection-I | (19) | for do | (20) | if then | (21) | | (22) | end | (23) | end | (24) | | (25) | % Improved mutation | (26) | for do | (27) | | (28) | end | (29) | % Crossover | (30) | if then | (31) | for do | (32) | | (33) | end | (34) | end | (35) | for do | (36) | | (37) | end | (38) | | (39) | for do | (40) | for do | (41) | if then | (42) | | (43) | end | (44) | end | (45) | end | (46) | % Boundary control mechanism | (47) | for do | (48) | for do | (49) | if or then | (50) | | (51) | end | (52) | end | (53) | end | (54) | % Selection-II | (55) | for do | (56) | if then | (57) | | (58) | | (59) | end | (60) | end | (61) | if then | (62) | | (63) | end | (64) | end |
|