Bee Colony System: Preciseness and Speed in Discrete Optimization

摘要

One of the useful patterns to create algorithms capable of solving complex problems is the foraging behavior of bees in finding food sources. In this article, a method has been presented for solving the complex problems in discrete spaces by simulation of this behavior of bees and also considering a memory for these bees. The proposed method has been successfully applied to solve the traveling salesman problem. The simulation results show the high ability of this algorithm in compare with the similar ones.