Table 6.

Simulation results for $M=40$, $N=8$ and the search domain area $100U\times 100U$ with different values for $P_n$ averaged in 30 runs—comparative analysis between butterfly optimization algorithm (BOA), firefly algorithm (FA), particle swarm optimization (PSO), EHO, HEHO, TGA, and dynsTGA (results for BOA, FA, and PSO were taken from [15]) (best results for each performance indicator are marked bold).

Algorithms	${\mathit{P}}_{\mathit{n}}=5$			${\mathit{P}}_{\mathit{n}}=2$
	Mean ${\mathit{N}}_{\mathit{NL}}$	Mean ${\mathit{E}}_{\mathit{L}}$	Computing Time (s)	Mean ${\mathit{N}}_{\mathit{NL}}$	Mean ${\mathit{E}}_{\mathit{L}}$	Computing Time (s)
BOA	4.7	0.28	0.65	4.5	0.21	0.53
FA	6.6	0.72	2.15	6.2	0.69	1.94
PSO	5.9	0.81	0.54	5.6	0.78	0.49
EHO	6.8	0.79	1.1	6.2	0.71	0.9
HEHO	5.3	0.45	1.2	5.1	0.37	1.0
TGA	5.5	0.42	0.9	5.0	0.36	0.8
dynsTGA	4.5	0.19	1.2	4.3	0.16	1.1