CABC–CSA: a new chaotic hybrid algorithm for solving optimization problems

Abstract

Recently a lot of methods have been presented for solving optimization problems. In this paper, we are trying to propose a new hybrid algorithm for solving these kinds of problem. The proposed algorithm is based on chaotic artificial bee colony and chaotic simulated annealing, CABC–CSA. The chaotic artificial bee colony finds new locations chaotically. Actually, the proposed algorithm provides a combination of local search accuracy of simulated annealing and the ability of global search of artificial bee colony. Furthermore, we used a different method for generating the initial population. The proposed algorithm is validated using 12 benchmark functions. The results are compared with those of the artificial bees’ algorithm, the hybrid algorithm of artificial bee colony and simulated annealing and particle swarm optimization. Simulation results show the efficiency of the proposed algorithm.