Research Article
An Improved Artificial Bee Colony Algorithm Based on Factor Library and Dynamic Search Balance
(1) Parameter initialization (PS = 2SN, Maxcycle = Maximum | number of iterations, ) | (2) Produce initial population by Eq. (1). | (3) Assess initial population // Calculate and memorize the | global best. | (4) Set . | (5) for each food source do, set end for | (6) do while | (7) /EMPLOYED BEE PROCEDURE/ | (8)for each do | (9)if then | (10)Produce by Eq. (11). | (11)else | (12)Produce by Eq. (2). | (13)end if | (14)Evaluate , if it is better, replace the original one. | (15)end for | (16)/ONLOOKER BEE PROCEDURE/ | (17)Calculate probability values for all by Eq. (4). | (18)Set , | (19)while do | (20)Produce random number | (21)if then | (22) | (23)if then | (24)Produce by Eq. (11). | (25)else | (26)Produce by Eq. (2). | (27)end if | (28)Evaluate , if it is better, replace the original one. | (29)end if | (30)Set . | (31)if then set end if | (32)end while | (33)Do dynamic search balance as depicted in Algorithm 1. | (34)Memorize the best GlobalMin. | (35)Set . | (36) end while |
|