Skip to main content
. 2023 Jun 5;23(11):5349. doi: 10.3390/s23115349
Algorithm 1: Pseudo Code of CHROA Technique
Beginning of Algorithm 1
    Initiate the horse population in the search space
    Calculate fitness of the horse and upgrade the optimal one
   While iteration < T
      Define the center of every herd from T
    For n = 1 to number of horse
    Find hbest
    Find cbest
    For T = 1 to horse velocity
      Estimate the rank of every horse from top to bottom
      Upgrade the horse velocity and location
      Calculate the fitness
next l
        next n
   If fitness condition is fulfilled
      End
     T = T+1, Return the Global optimum solution
  End While
    End of Algorithm.