BEE COLONY SYSTEM: PRECISENESS AND SPEED IN DISCRETE OPTIMIZATION
Foraging behavior of bees in finding food resource is one of the useful patterns to develop algorithms for solving complex problems. This article by simulation of such behavior and consider a memory for them proposed a method in discrete spaces. The proposed method is applied to Travel Salesman Problem (TSP) and successfully solved it. Simulation results have been proved the performance of our algorithm compared to similar strategies.
bee colony system discrete optimization traveling salesman problem artificial life