Parallel artificial bee colony algorithm for traveling salesman problem

In this study, we proposed a parallel implementation of the combinatorial type artificial bee colony algorithm which has an efficient neighbor production mechanism. Running time and performance tests of the proposed parallel model were carried on the traveling salesmen problem. Results show that parallel artificial bee colony algorithm decreases the running time due to exploiting the computational power of parallel computing systems. Beside, better quality solutions are obtained compared to the reproduction methods of the genetic algorithm.