In the April 2011 issue of MSDN Magazine I wrote an article which describes Simulated Bee Colony (SBC) algorithms. See http://msdn.microsoft.com/enus/magazine/gg983491.aspx. SBC algorithms model the behavior of foraging honey bees to find good (but not necessarily optimal) solutions to combinatorial optimization problems which cannot be solved using normal techniques. In the article I use an SBC to solve the Traveling Salesman Problem where you have a set of cities and must visit each city exactly once in such a way that the total distance traveled is minimized. See the screenshot below. SBC algorithms are related to, but distinct from, other metaheuristics based on the behavior of natural systems such as Genetic Algorithms based on chromosomes and mating, Ant Colony Optimization based on ant pheromones, and Simulated Annealing based on cooling metal. After I wrote the MSDN Magazine article I applied an SBC algorithm to the problem of graph partitioning and was able to find several new worldrecord best partitionings for benchmark problems.
Books (By Me!)
Events (I Speak At!)
 2017 Big Data Innovation Summit
 2017 Interop Conference
 2017 Microsoft Mega Event
 2017 Visual Studio Live Las Vegas
 2016 IoT Evolution Conference
 2016 G2E Conference
 2016 SAS Analytics Conference
 2016 Machine Learning Conference
 2016 IT/Dev Connections
 2016 Microsoft TechReady22
 2016 DevIntersection

Recent Posts
Archives
Categories