Algorithm 1 Rat optimization algorithm without Levy flight strategy

Begin Step 1. Set the initial position of the rat swarm $X_i(i=1,2,\dots ,n)$ Step 2. Determine all the search agents’ fitness      $X^{\ast }$ = the best search agent Step 3. while ($t<Inte{r}_{\max }$) do        for each search agent Update $A$, $C$, $R$, $q$, r, and $a$          if 1 $(q<0.5)$ if 2 $(A<2.5)$ Update the location of the current search agent employing Equation (2) else if 2 $(A\ge 2.5)$ Randomly choose a search agent $X_{rand}$ Update the location of the current search agent employing Equation (5) end if 2          else if 1 $(q\ge 0.5)$ Update the location of the current search agent employing Equation (7) end if 1 end for        Verify whether any search agents cross the search space and make the necessary changes        Determine all the search agents’ fitness If a better solution exists, update $X^{\ast }$ $t=t+1$      end while      return $X^{\ast }$ End