Hierarchical Artificial Bee Colony Algorithm for RFID Network Planning Optimization

Table 3

Performance of HABC on 100𝐷 benchmark functions 𝑓₁--𝑓₄ with the different grouping number 𝐾. In bold are the best results. Note that values indicated in brackets denoted to function evaluations (FEs) are used to obtain the optimal value.

Func.		𝐾⊂𝑆	𝐾=5	𝐾=10	𝐾=50	𝐾=100
𝑓1	Mean	0  (91000)	0  (45000)	2.00𝑒−080	3.70𝑒−043	6.56𝑒−042
	Std	0	0	1.03𝑒−001	6.31𝑒−043	1.27𝑒−041
𝑓2	Mean	1.10𝑒−014	1.47	1.56	6.50𝑒−001	𝟏.𝟔𝟏𝐞−𝟎𝟐𝟐
	Std	1.37𝑒−014	3.12𝑒−001	2.47𝑒−001	1.13	𝟏.𝟑𝟖𝐞−𝟎𝟐𝟐
𝑓3	Mean	0	0	7.25𝑒−014	5.39𝑒−013	8.22𝑒−013
	Std	0	0	1.45𝑒−013	2.32𝑒−013	1.33𝑒−013
𝑓4	Mean	𝟏.𝟕𝟎𝐞−𝟎𝟎𝟑	7.69𝑒−002	4.45𝑒−002	3.23𝑒+002	1.99𝑒+002
	Std	𝟏.𝟏𝟎𝐞−𝟎𝟎𝟑	1.11𝑒−001	2.71𝑒−002	5.37𝑒+002	3.94𝑒+002