One of the most famous mathematical problems is the traveling salesman problem: Given a set of cities, how do you determine the shortest route that visits each of the cities exactly once? Of course, you can simply go through all possible routes, but this approach is feasible only for a very limited number of cities. There are more clever ways to solve the problem, but the time needed to find a solution always increases exponentially with the number of cities. In other words, there is no known efficient way to solve the traveling salesman problem.
Photo from Wikimedia Commons
It is quite cool, therefore, that bees appear to be able to solve the traveling salesman problem, as reported by Lihoreau, Chittka and Raine in a forthcoming paper in The American Naturalist. The authors made an artificial flower-arrangement. Recordings of the flight paths showed that the bees chose the most efficient route to visit all flowers. Quite a feat for such a tiny-brained animal!
I haven't read the entire paper (which is due in December, for now there is only a summary on the website of The American Naturalist), but I do wonder about a few things. One of the characteristics of the traveling salesman problem is that there are a finite number of connections and you're allowed to visit each city only once. In contrast, the bees can fly however they like and I would assume that they don't care if they have to fly over a flower that they …