Artificial Bee Colony with Different Mutation Schemes: A comparative study

Abstract

Artificial Bee Colony (ABC) is a swarm-based metaheuristic for continuous optimization. Recent work hybridized this algorithm with other metaheuristics in order to improve performance. The work in this paper, experimentally evaluates the use of different mutation operators with the ABC algorithm. The introduced operator is activated according to a determined probability called mutation rate (MR). The results on standard benchmark function suggest that the use of this operator improves performance in terms of convergence speed and quality of final obtained solution. It shows that Power and Polynomial mutations give best results. The fastest convergence was for the mutation rate value (MR=0.2).

Keywords

• Artificial Bee Colony
• Evolutionary Algorithms
• Mutation
• Meta-heuristic algorithm
• Polynomial mutation