An Evolutionary Frog Leaping Algorithm for Global Optimization Problems and Applications

Table 1

Details of benchmark problem.

Fun	Benchmark problem	Type low	Low	Up	Dim	Optimum values
F1	Sphere function	U	−100	100	30	0
F2	Schwefel’s problem 2.22	U	−10	10	30	0
F3	Schwefel’s problem 1.2	U	−100	100	30	0
F4	Quartic function	U	−1.28	1.28	30	0
F5	Rastrigrin function	M	−5.12	5.12	30	0
F6	Ackley function	M	−32	32	30	0
F7	Griewank function	M	−600	600	30	0
F8	Rosenbrock function	M	−10	10	30	0
F9	Penalized function	M	−50	50	30	0
F10	Weierstrass’s function	M	−0.5	0.5	30	0
F11	Zakharov function	M	−5	10	30	0
F12	Alpine function	M	−10	10	30	0
F13	Salomon problem	M	−100	100	30	0
F14	Periodic problem	M	−10	10	30	0.9
F15	Inverted cosine mixture problem	M	−1	1	30	0
F16	Sphere function	U	−100	100	30	−1400
F17	Rotated high conditioned elliptic function	U	−100	100	30	−1300
F18	Rotated discus function	U	−100	100	30	−1100
F19	Different powers function	U	−100	100	30	−1000
F20	Rotated Ackley’s function	M	−100	100	30	−700
F21	Rotated Weierstrass function	M	−100	100	30	−600
F22	Rotated Griewank’s function	M	−100	100	30	−500
F23	Rotated Schwefel’s function	M	−100	100	30	100
F24	Expanded Scaffer’s F6 function	M	−100	100	30	600
F25	Shifted and rotated Schwefel’s function	M	−100	100	30	1100
F26	Hybrid function 1 (N = 3)	M	−100	100	30	1700
F27	Hybrid function 2 (N = 3)	M	−100	100	30	1800
F28	Hybrid function 4 (N = 4)	M	−100	100	30	2000
F29	Hybrid function 5 (N = 5)	M	−100	100	30	2100
F30	Composition function 2 (N = 3)	M	−100	100	30	2400