Research Article
Lévy-Flight Moth-Flame Algorithm for Function Optimization and Engineering Design Problems
) Initialize the position of moths | () While (Iteration <= Max_iteration) | () Update flame no using (8) | () = FitnessFunction(); | () if iteration = = 1 | () = sort(); | () = sort(); | () else | () = sort(, ); | () = sort(, ); | () end | () for | () for | () Update and | () Calculate using (7) with respect to the corresponding moth | () Update using (5) and (6) with respect to the corresponding moth | () end | () end |
|