“…Initialize main metaheuristics control parameters N and T Initialize search space parameters D, u j and l j Initialize CFAEE control parameters γ, β 0 , α 0 , α min , K and φ Generate initial random population P init = {x i,j }, i = 1, 2, 3..., N; j = 1, 2, , ...D using Equation (15) in the search space while t < T do for i = 1 to N do for z = 1 to i do if I z < I i then Move solution z in the direction of individual i in D dimensions (Equation ( 12)) Attractiveness changes with distance r as exp[−γr] (Equation ( 10)) Evaluate new solution, replace the worse individual with better one and update intensity of light (fitness) end if end for end for if t < φ then Replace all solutions for which trial = limit with random ones using Equation ( 15) else Replace all solutions for which trial = limit with guided replacement using Equation ( 16) for k = 1 to K do Perform gBest CLS around the x * using Equations ( 17)-( 19) and generate x * Retain better solution between x * and x * end for end if Update α and λ according to Equations ( 14) and (20), respectively end while Return the best individual x * from the population Post-process results and perform visualization…”