A Hybrid Artificial Bee Colony Algorithm Combined with Simulated Annealing Algorithm for Traveling Salesman Problem

Abstract

In order to solve travelling salesman problem (TSP), a hybrid artificial bee colony algorithm combined with simulated annealing algorithm (HABC-SA) is presented for TSP. This algorithm gives a discrete coding method for food source position. Crossover and mutation operators in genetic algorithm are introduced into the new algorithm to do local search, Simulated annealing idea is applied in this hybrid artificial bee colony algorithm to increase the diversity of food sources. The proposed algorithm is tested on benchmark problems, and results show that this algorithm can avoid pre-maturity and advance constringency for TSP.