An Adaptive Shrinking Grid Search Chaotic Wolf Optimization Algorithm Using Standard Deviation Updating Amount

Table 2

Test functions [25].

Order	Function	Expression	Dimension	Range	Optimum
1	Matyas	F1 = 0.26 × ( + ) − 0.48 × x1 × x2	2	[−10, 10]	min f = 0
2	Easom	F2 = −cos (x1) × cos (x2) × exp[− (x1 − π)^2 − (x2 − π)^2]	2	[−100, 100]	min f = −1
3	Sumsquares	F3 =	10	[−1.5, 1.5]	min f = 0
4	Sphere	F4 =	30	[−1.5, 1.5]	min f = 0
5	Eggcrate	F5 =  +  + 25 × (sin^2x1 + sin^2x2)	2	[−π, π]	min f = 0
6	Six hump camel back	F6 = 4 × x1 − 2.1 + (1/3) ×  + x1 × x2 − 4 ×  + 4 ×	2	[−5, 5]	min f = −1.0316
7	Bohachevsky3	F7 =  + 2 ×  − 0.3 × cos (3πx1 + 4πx2) + 0.3	2	[−100, 100]	min f = 0
8	Bridge	F8 =  − 0.7129	2	[−1.5, 1.5]	max f = 3.0054
9	Booth	F9 = (x1 + 2 × x2 − 7)^2 + (2 × x1 + x2 − 5)^2	2	[−10, 10]	min f = 0
10	Bohachevsky1	F10 =  + 2  − 0.3 × cos (3πx1) − 0.4 × cos (4πx2) + 0.7	2	[−100, 100]	min f = 0
11	Ackley	F11 = −20 × exp (−0.2 ×) − exp () + 20 + e	6	[−1.5, 1.5]	min f = 0
12	Quadric	F12 =	10	[−1.5, 1.5]	min f = 0