Discrete and Continuous Optimization Based on Hierarchical Artificial Bee Colony Optimizer

Table 9

Parameters of the test functions.

𝑓	Dimensions	Initial range	𝑥^∗	𝑓  (𝑥^∗)
𝑓1	100	[−100,100]^D	[0,0,…,0]	0
𝑓2	100	[−30,30]^D	[1,1,…,1]	0
𝑓3	100	[−65.536,65.536]^D	[0,0,…,0]	0
𝑓4	100	[−10,10]^D	[0,0,…,0]	0
𝑓5	100	[−5.12,5.12]^D	[0,0,…,0]	0
𝑓6	100	[−500,500]^D	[420.9867,…,420.9867]	0
𝑓7	100	[−32.768,32.768]^D	[0,0,…,0]	0
𝑓8	100	[−600,600]^D	[0,0,…,0]	0
𝑓9	100	[−100,100]^D	[0,0,…,0]	−450
𝑓10	100	[−100,100]^D	[0,0,…,0]	−450
𝑓11	100	[−100,100]^D	[0,0,…,0]	390
𝑓12	100	No bounds	[0,0,…,0]	−180
𝑓13	100	[−32,32]^D	[0,0,…,0]	−140
𝑓14	100	[−5,5]^D	[0,0,…,0]	−330
𝑓15	100	[−5,5]^D	[0,0,…,0]	−330
𝑓16	30	[0,1]	[1,1,…,1]	0
𝑓17	60	[0,1]	[0,0,…,0] or [1,1,…,1] or […,6∗0,…,6∗1,…]	0
𝑓18	120	[0,1]	[0,0,…,0]	0
𝑓19	120	[0,1]	[0,1,1,0,1,1,…]	0
𝑓20	120	[0,1]	[0,0,1,0,0,1,…]	0

∗Represents the solution corresponding to the optimal value of the objective function, namely the optimal solution.