Smallest-Small-World Cellular Harmony Search for Optimization of Unconstrained Benchmark Problems

Table 5

Results of 30ND Problems.

	SSWCHS	CHS	SHS
1. Step function
Mean	0.00𝐸+00	1.09𝐸+00	5.60𝐸+00
Best	0.00𝐸+00	0.00𝐸+00	0.00𝐸+00
Worst	0.00𝐸+00	3.00𝐸+00	1.20𝐸+01
SD	0.00𝐸+00	9.81𝐸−01	2.53𝐸+00
Feasible solution	100	36	1
Mean iteration	30,673.72	148,717.39	91,353.00
Iteration SD	41,902.01	49,240.37	—
2. Rastrigin function
Mean	4.69𝐸−02	2.99𝐸+00	6.09𝐸+00
Best	2.78𝐸−03	1.12𝐸−02	1.01𝐸+00
Worst	1.00𝐸+00	5.01𝐸+00	8.98𝐸+00
SD	1.95𝐸−01	1.31𝐸+00	1.99𝐸+00
Feasible solution	92	0	0
Mean iteration	113,790.16	—	—
Iteration SD	47,257.60	—	—
3. Griewank function
Mean	1.03𝐸−01	1.43𝐸−01	6.94𝐸−01
Best	1.46𝐸−06	2.71𝐸−02	5.47𝐸−06
Worst	4.86𝐸−01	4.85𝐸−01	1.25𝐸+00
SD	9.80𝐸−02	8.06𝐸−02	4.47𝐸−01
Feasible solution	10	0	3
Mean iteration	73,642.00	—	208,726.00
Iteration SD	43,912.52	—	26,918.84
4. Ackley function
Mean	4.62𝐸−02	1.31𝐸+00	1.58𝐸+00
Best	3.51𝐸−03	6.10𝐸−03	5.97𝐸−03
Worst	1.50𝐸+00	1.65𝐸+00	3.46𝐸+00
SD	2.11𝐸−01	2.78𝐸−01	7.17𝐸−01
Feasible solution	96	3	8
Mean iteration	79,262.84	141,376.33	160,133.00
Iteration SD	64,770.38	35,365.89	58,642.35