An Adaptive Hybrid Algorithm Based on Particle Swarm Optimization and Differential Evolution for Global Optimization

Table 1

Benchmark configurations.

Function	Name	Search space	Global optimal 𝑓(𝑥^∗)	𝑥^∗
𝑓1	Sphere	[−100,100]	0	0
𝑓2	Weighted sphere	[−100,100]	0	0
𝑓3	Schwefel’s Problem 2.22	[−10,10]	0	0
𝑓4	Shifted Schwefel’s Problem 1.2	[−100,100]	0	0
𝑓5	Schwefel’s Problem 2.21	[−100,100]	0	0
𝑓6	Rosenbrock	[−30,30]	0	(1, 1, …, 1)
𝑓7	Quartic	[−1.28,1.28]	0	0
𝑓8	Rastrigin	[−5,5]	0	0
𝑓9	Noncontinuous Rastigin	[−5,5]	0	0
𝑓10	Ackley	[−32,32]	0	0
𝑓11	Griewank	[−600,600]	0	0
𝑓12	Penalized 1	[−50,50]	0	0
𝑓13	Penalized 2	[−50,50]	0	0
𝑓14	Weierstrass	[−0.5,0.5]	0	0
𝑓15	Rotated Rastrigin	[−5,5]	0	0
𝑓16	Rotated noncontinuous Rastrigin	[−5,5]	0	0
𝑓17	Rotated Ackley	[−32,32]	0	0
𝑓18	Rotated Griewank	[−600,600]	0	0