Skip to main content
. 2024 May 13;10:e2031. doi: 10.7717/peerj-cs.2031

Algorithm 1 . Pseudocode of the suggested MSCHO algorithm.

 1:  Set initial parameter values
 2:  Initialize agent populace P by applying QRL
 3:  while T > t do
 4:    Utilized appropriate SCHA search technique to reposition agents
 5:    Compute agent objective function outcome
 6:    for each agent A in P do
 7:      if A has not shown improvement in 2 iterations then
 8:        Initialize a new agent a by applying QRL
 9:      end if
10:    end for
11:  end while
12:  return Best attained agent in P