An efficient Bee Colony Optimization algorithm for Traveling Salesman Problem using frequency-based pruning

Abstract

In a bee colony, bees perform waggle dance in order to communicate the information of food source to their hive mates. This foraging behaviour has been adapted in a Bee Colony Optimization (BCO) algorithm together with 2-opt local search to solve the Traveling Salesman Problem (TSP) [1]. To reduce the high overhead incurred by 2-opt in the BCO algorithm proposed previously, two mechanisms named frequency-based pruning strategy (FBPS) and fixed-radius near neighbour (FRNN) 2-opt are presented. FBPS suggests that only a subset of promising solutions are allowed to perform 2-opt based on the accumulated frequency of its building blocks recorded in a matrix. FRNN 2-opt is an efficient implementation of 2-opt which exploits the geometric structure in a permutation of TSP sequence. Both mechanisms are tested on a set of TSP benchmark problems and the results show that they are able to achieve a 58.42% improvement while maintaining the solution quality at 0.02% from known optimal.

Bee‐Inspired Algorithms Applied to Vehicle Routing Problems: A Survey and a Proposal

“…In Wong et al [76][77][78][79], the authors tackled the TSP by proposing some modifications on Wong et al [36] to improve the efficiency of the algorithm. The modification resides on the local search used after the foraging phase.…”

“…In Wong et al [77], the authors expanded the work in Wong et al [76] to solve the TSP, by changing the transition rule in order to make it quicker, in terms of computational time. Instead of visiting one city at a time, the bee is now allowed to visit a set of cities (a subroute).…”

Solving Asymmetric Traveling Salesman Problems using a generic Bee Colony Optimization framework with insertion local search

“…The implementation of such initialization procedure is domain specific. In this paper, the Nearest Neighbourhood heuristic and the state transition heuristic as described in [26] are employed. Bees are also initialized with random solutions.…”

Bee routing protocol for intermittently connected mobile networks

“…The bees perform a dancing ceremony called the waggle dance. The waggle dance [31] acts as the communication medium among bees notifying about the quantity of food collected and the closeness of the path. When a bee finds a source of food, on its return to the hive, the bees dance in a figure eight pattern [32]- [33].…”