Solving Traveling Salesman Problem by Using Combinatorial Artificial Bee Colony Algorithms

摘要

Artificial bee colony (ABC) is a quite popular optimization approach that has been used in many fields, with its not only standard form but also improved versions. In this paper, new versions of ABC algorithm to solve TSP are introduced and described in detail. One of these is the combinatorial version of standard ABC, called combinatorial ABC (CABC) algorithm. The other one is an improved version of CABC algorithm, called quick CABC (qCABC) algorithm. In order to see the efficiency of the new versions, 15 different TSP benchmarks are considered and the results generated are compared with different well-known optimization methods. The simulation results show that, both CABC and qCABC algorithms demonstrate good performance for TSP and also the new definition in quick ABC (qABC) improves the convergence performance of CABC on TSP.