Research Article
Enhancing Artificial Bee Colony Algorithm with Self-Adaptive Searching Strategy and Artificial Immune Network Operators for Global Optimization
Algorithm 3
Pseudocode of main body of the enhanced ABC algorithm.
| (1) Generate the initial population based on chaotic maps and affinity strategy () | | (2) Evaluate the fitness of the population | | (3) Set cycle to 1 | | (4) Repeat | | (5) For each employed bee { | | Produce new solution by using (7) | | Calculate its fitness value fit | | Apply greedy selection process} | | (6) Adopt negative selection and network compression to eliminate redundant and similar food sources by using (18) | | (7) Randomly generate the same number of new individuals | | (8) Calculate the probability values for the solution () by (16) | | (9) For each onlooker bee { | | Select a solution depending on | | Produce new solution | | Calculate its fitness value | | Apply greedy selection process} | | (10) If there is an abandoned solution for the scout, | | then replace it with a new solution which will be randomly produced by (4) | | (11) Memorize the best solution so far | | (12) Cycle = cycle + 1 | | (13) Until cycle = MEN |
|