Skip to main content
. 2024 Oct 19;9(10):643. doi: 10.3390/biomimetics9100643
Algorithm 3 HVPI
Input:
       Lsorted–individuals sorted in decreasing fitness values;
       ε–accuracy level;
       ph–the fitness of global optima;
Output:

  •  S–a set of individuals identified as solutions

  •  1:

    S←∅

  •  2:

    while not reaching the end of Lsorted do

  •  3:

       Get the next unprocessed p∈Lsorted;

  •  4:

       notNewNiche← False;

  •  5:

       if ph−fit(p)≤ε then

  •  6:

         for each s∈S do

  •  7:

            if hill-valley(s, p)==False then

  •  8:

                notNewNiche← True;

  •  9:

                break;

  • 10:

            end if

  • 11:

         end for

  • 12:

         if notNewNiche== False then

  • 13:

            S←S∪{p};

  • 14:

         end if

  • 15:

       end if

  • 16:

    end while