Algorithm 3: Late Acceptance Hill-Climbing (LAHC)

X → Initial CRNN structure obtained from the SSA L → length of the list for i = 1 to L do        fi = f(X).   > Initialize the fitness list. X*= X.             >Memorize the best solution. for i = 1 to Max_iterations do       X’ = NS(X).    >Move from the current solution to a new one.       v = i mod L       if f(X’) ≤ fv ll f(X’) ≤ f(X) then              X = X0. >Accept the new solution.              if X0 < X_ then                    X_ = X0              fv = f(X).     >Insert the current cost to the fitness list. Output: X_