Skip to main content
. 2023 Jul 1;25(7):1015. doi: 10.3390/e25071015
Algorithm 2 PC strategy
  • Require: 

    OT (temporary population), N (population size)

  • Ensure: 

    O (final population)

  • 1:

    While |O| < N

  • 2:

       For each solution in OT do

  • 3:

          Randomly select an individual to determine its neighbors by Equation (5)

  • 4:

          Calculate the crowding degree value of individual by Equation (6)

  • 5:

       End

  • 6:

       Put the individual o=arg max(CD(x)) to O

  • 7:

       O=O∪o

  • 8:

       Update OT and remove o from OT

  • 9:

    Endwhile

  • 10:

    return O