Session Details

Bumblebee: an Artificial Bee Colony algorithm in F#  

Level :
Date :
3:30 PM Saturday
Room :
Interested : (-) - Registered : (-)


Sometime in 2010, after years of C# development, I discovered F#, and found programming in a functional style both tricky and fun. Inspired by an article on Artificial Bee Colony algorithms, an optimization algorithm based on the intelligent foraging behaviour of honey bee swarms, I decided as a learning project to convert it from C# into a F# library, Bumblebee, which is available open-source at In this talk, I want to do 4 things: 1) cover the basics of Artificial Bee Colony algorithms, and illustrate what problems it can help solve, 2) solve a problem together with Bumblebee, and use it as a F# primer, 3) open the hood and discuss some of the design aspects (making the API both F# and C# friendly, using the Task Parallel Library for parallelism, using OO and functional styles together, unit testing...) 4) share my learning experience transitioning from a C#-mindset to thinking F#. This talk is particularly relevant for C# developers who are F#-curious! Knowing F# beforehand is not required, but a certain comfort with functional concepts (e.g. LINQ in C#) will help.

The Speaker(s)


Mathias Brandewinder

I have been writing software on .NET for 10 years, mostly C#, until I fell in love with F# and functional programming. I enjoy arguing about code and how to make it better, and get very excited when discussing testing or F#. My other professional interests are applied math and machine learning. If you want to know more about me, you can check out my blog here or find me on Twitter as @brandewinder.
  • Not Interested
  • Interested
  • Attending