Solving TSP by using combinatorial Bees algorithm with nearest neighbor method

Abstract

AbstractBees Algorithm (BA) is a popular meta-heuristic method that has been used in many different optimization areas for years. In this study, a new version of combinatorial BA is proposed and explained in detail to solve Traveling Salesman Problems (TSPs). The nearest neighbor method was used in the population generation section of BA, and the Multi-Insert function was added to the local search section instead of the Swap function. To see the efficiency of the proposed method, 24 different TSPs were used in experimentation and the obtained results were compared with both classical combinatorial BA and other successful meta-heuristic methods. After detailed analyses and experimental studies on different problems, it has been observed that the proposed method performs well for TSPs and competes well with other methods.