Quick Combinatorial Artificial Bee Colony -qCABC- Optimization Algorithm for TSP

Abstract

Combinatorial Artificial Bee Colony Algorithm (CABC) is a new version of Artificial Bee Colony (ABC) to solve combinatorial type optimization problems and quick Artificial Bee Colony (qABC) algorithm is an improved version of ABC in which the onlooker bees behavior is modeled in more detailed way. Studies showed that qABC algorithm improves the convergence performance of standard ABC on numerical optimization. In this paper, to see the performance of this new modeling way of onlookers' behavior on combinatorial optimization, we apply the qABC idea to CABC and name this new algorithm as quick CABC (qCABC). qCABC is tested on Traveling Salesman Problem and simulation results show that qCABC algorithm improves the convergence and final performance of CABC