TSP Problem Using Modified ABC Based on Dynamically Division of Bees

Artificial Bee Colony Algorithm (ABC) is an optimization algorithm used to find out the global optima. In ABC, each bee stores the information of feasible solution or candidate solution and stochastically modifies this over time, based on the information provided by neighboring bees, it speculative modifies over time and based on the best solution found by the bee itself. In this proposed work, the swarms of bees are dynamically divided into smaller groups and search process is performed by independent smaller group of bees. Also in original ABC algorithm, an additional operator, i.e. Mutation operator, is used in the artificial bee colony algorithm after the employed bee phase. Experiments are performed on the travelling salesman problem (TSP) to check the accuracy of proposed algorithm. Also proposed algorithm results are compared with previously defined algorithms like standard ABC algorithm and ABC with SPV algorithm.