Table 1 Description of symbols involved in LSO and ACIE_LSO algorithms
Parameter | Meanings |
|---|---|
N | Total number of lion populations |
D | Total dimension of each lion position |
\({x}_{i}=({x}_{i1},{x}_{i2},\cdots ,{x}_{iD})\) | Position of the ith lion |
xij | The jth dimension of the ith lion |
\({x}_{\mathrm{min},j}\);\({x}_{\mathrm{max},j}\) | Minimum and maximum values of the jth dimension, respectively |
\({g}^{k}\) | Optimal position of the kth generation population |
\({x}_{i}^{k+1}\) | The position of the ith lion in the kth iteration |
\({p}_{i}^{k}\) | Historical optimal position of the ith lion for the kth generation |
\({p}_{c}^{k}\) | Historical best position of partners randomly selected from the kth generation of lionesses |
\({p}_{m}^{k}\) | The best position in the history of the kth generation of lion cubs following lionesses |
\(\overline{{g }^{k}}\) | Location of the ith lion cub driven within the range of the hunt, \(\overline{{g }^{k}}=\overline{{x }_{\mathrm{max}}}+\overline{{x }_{\mathrm{min}}}-{g}^{k}\) |
γ | Random numbers generated according to the normal distribution N(0,1) |
\(\beta\) | Percentage of adult lions in the pride factor |
\(\overline{{x }_{\mathrm{min}}}\),\(\overline{{x }_{\mathrm{max}}}\) | Minimum and maximum mean values for each dimension of the lion’s activity range space |
T, t | Maximum iterations and the current iteration, respectively |
q | Probability factor of the lion cub behavior which satisfies uniform distribution U(0,1) |
α1, α2 | Random numbers in the range (0,1) |
\({\alpha }_{f}\) | Lioness movement range perturbation factor, \({\alpha }_{f}={\alpha }_{1}\left(\overline{{x }_{\mathrm{max}}}-\overline{{x }_{\mathrm{min}}}\right)\mathrm{exp}{\left(-30t/T\right)}^{10}\) |
\({\alpha }_{c}\) | Lion cub movement range perturbation factor, \({\alpha }_{c}={\alpha }_{2}(\overline{{x }_{\mathrm{max}}}-\overline{{x }_{\mathrm{min}}})(T-t)/T\) |