Research Article

An Advanced Amalgam of Nature-Inspired Algorithms for Global Optimization Problems

Algorithm 1

Pseudocode of ANIA.
1.Define parameters: Pop Size , Max Ftn Evaluations ;
2.Initialize the with size uniformly and randomly;
3.Start Counter of Function Evaluations =0;
4.Determine the values of , for each ;
5.Assign ;
6.Nominate Teacher, , and as top three solutions of the ;
7.Set = round(/2) and ;
8.while do
9. Assign randomly solutions to GWO from the ;
10. Find new positions using GWO equations for assigned solutions;
11. Determine the fitness values for new positions;
12. Update positions by comparing the assigned with new positions;
13. Find update ratio, ;
14. Assign the unassigned solution of to TLBO;
15. Select randomly round(/2) solutions from assigned;
16. Find new positions via teacher phase equation for selected solutions;
17. Determine the fitness values for new positions;
18. Update positions by comparing the selected with new positions;
19. Assign the unassigned solution to learner phase;
20. Find new positions via learner phase equation for assigned solutions;
21. Determine the fitness values for new positions;
22. Update positions by comparing the assigned with new positions;
23. Find update ratio, ;
24. Nominate Teacher, , and as top three solutions of the ;
25. Assign ;
26. if and then
27. Set and ;
28. else if
29.  ;
30.  if then
31.  ;
32. end if
33.  ;
34. else if
35.  ;
36.  if then
37.   ;
38. end if
39.  ;
40. else
41.  ;
42.  ;
43. end if
44. end while