A Modified Bat Algorithm for Solving Large-Scale Bound Constrained Global Optimization Problems

Table 2

Experimental results provided by the modified Bat algorithm for IEEE-CEC’2005 benchmark functions [51].

Function		Minimum	Maximum	Mean	St. dev.	Time/run (s)
F1	0					1.062845
	10					1.114802
	20					1.756442
	30					1.110323
	40					1.748652
F2	0					1.119200
	10					1.182674
	20					1.876191
	30					1.189104
	40					1.855762
F3	0					2.896229
	10					2.019358
	20					2.520408
	30					2.012454
	40					2.547332
F4	0					2.254365
	10					2.280442
	20					2.969045
	30					2.277696
	40					2.961883
F5	0					2.809083
	10					2.834624
	20					2.090643
	30					2.795133
	40					2.084235
F6	0					2.095513
	10					2.150034
	20					2.819058
	30					2.077619
	40					2.786852
F7	0					2.959575
	10					2.078052
	20					2.680421
	30					2.982949
	40					2.727031
F8	0					2.010502
	10					2.071624
	20					2.680243
	30					2.991901
	40					2.681372
F9	0					1.094128
	10					1.178994
	20					1.876494
	30					1.108350
	40					1.841847
F10	0					2.946432
	10					2.024723
	20					2.609384
	30					2.920436
	40					2.637320
F11	0					10.972307
	10					11.500669
	20					11.392789
	30					11.080728
	40					11.438615