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

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.

[1]  Jon Jouis Bentley,et al.  Fast Algorithms for Geometric Traveling Salesman Problems , 1992, INFORMS J. Comput..

[2]  F. Dyer.  The biology of the dance language. , 2002, Annual review of entomology.

[3]  Gao Shang,et al.  Solving Traveling Salesman Problem by Ant Colony Optimization Algorithm with Association Rule , 2007, Third International Conference on Natural Computation (ICNC 2007).

[4]  Yue Zhang,et al.  BeeHive: An Efficient Fault-Tolerant Routing Algorithm Inspired by Honey Bee Behavior , 2004, ANTS Workshop.

[5]  Dušan Teodorović,et al.  Vehicle Routing Problem With Uncertain Demand at Nodes: The Bee System and Fuzzy Logic Approach , 2003 .

[6]  Craig A. Tovey,et al.  On Honey Bees and Dynamic Server Allocation in Internet Hosting Centers , 2004, Adapt. Behav..

[7]  Chin Soon Chong,et al.  Using A Bee Colony Algorithm For Neighborhood Search In Job Shop Scheduling Problems , 2007 .

[8]  Dervis Karaboga,et al.  A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm , 2007, J. Glob. Optim..

[9]  Malcolm Yoke-Hean Low,et al.  A Bee Colony Optimization Algorithm to Job Shop Scheduling , 2006, Proceedings of the 2006 Winter Simulation Conference.

[10]  Dušan Teodorović,et al.  Swarm intelligence systems for transportation engineering: Principles and applications , 2008 .

[11]  Bernard H. Stark,et al.  IEEE International Conference on Industrial Informatics , 2009 .

[12]  T. Schnier,et al.  Genetic Engineering and Design Problems , 1997 .

[13]  John S. Gero,et al.  Evolving design genes in space layout planning problems , 1998, Artif. Intell. Eng..

[14]  Panta Lucic,et al.  Computing with Bees: Attacking Complex Transportation Engineering Problems , 2003, Int. J. Artif. Intell. Tools.

[15]  Annie S. Wu,et al.  A Comparison of the Fixed and Floating Building Block Representation in the Genetic Algorithm , 1996, Evolutionary Computation.

[16]  Li-Pei Wong,et al.  Bee Colony Optimization with local search for traveling salesman problem , 2008, 2008 6th IEEE International Conference on Industrial Informatics.

[17]  T. Seeley,et al.  The use of waggle dance information by honey bees throughout their foraging careers , 2005, Behavioral Ecology and Sociobiology.

[18]  K. Frisch.  Decoding the Language of the Bee , 1974 .

[19]  Ben Paechter,et al.  Improving Street Based Routing Using Building Block Mutations , 2002, EvoWorkshops.

[20]  D. Karaboga,et al.  On the performance of artificial bee colony (ABC) algorithm , 2008, Appl. Soft Comput..