Hierarchical Artificial Bee Colony Algorithm for RFID Network Planning Optimization

Table 9

Parameters of the test functions.

𝑓	Dimensions	Initial Range	𝑥^∗	𝑓(𝑥^∗)
𝑓1	100	[−100,100]^𝐷	[0, 0, …, 0]	0
𝑓2	100	[−30,30]^𝐷	[1, 1, …,1]	0
𝑓3	100	[−5.12,5.12]^𝐷	[0, 0, …, 0]	0
𝑓4	100	[−500,500]^𝐷	[420.9867, …, 420.9867]	0
𝑓5	100	[−32.768,32.768]^𝐷	[0, 0, …, 0]	0
𝑓6	100	[−100,100]^𝐷	[0, 0, …, 0]	−450
𝑓7	100	[−100,100]^𝐷	[0, 0, …, 0]	−450
𝑓8	100	[−100,100]^𝐷	[0, 0, …, 0]	390
𝑓9	100	No bounds	[0, 0, …, 0]	−180
𝑓10	100	[−32,32]^𝐷	[0, 0, …, 0]	−140