Stochastic Fractal Search Algorithm for Template Matching with Lateral Inhibition

Algorithm 1

SFS pseudo algorithm.

Initialize a population of points

While   < maximum generation  Do

  For  each Point in the system  Do

    Call Diffusion Process with the following process:

       = (maximum considered number of diffusion).

     For   to   Do

      If  (user uses Gaussian walk to solve the problem)

       Create a new point based on Eq. (1).

      Else  (user uses another Gaussian Walks to solve the problem)

      Create a new point based on Eq. (2).

  Call Updating Process with the following process

    First Updating Process:

    First, all points are ranked based on Eq. (5).

    For  each Point in the system  Do

     For  each component in   Do

      If  ()

       Update the component in based on Eq. (6).

      Else

       Do nothing.

    Second Updating Process:

    Once again, all points obtained by the first update Process are ranked based on Eq. (5).

    For  each new point in the system  Do

      If  ()

       Update the position based on Eqs. (7).

      Else

       Do nothing.