One of the most fiendishly complex mathematical computations is the so-called ‘Travelling Salesman Problem’. Given a list of locations (e.g. cities) and the distances between them, it involves finding the shortest possible route in which each location is visited only once. As the number of locations increases past anything more than a handful, the complexity of the problem increases dramatically, to staggering proportions.
‘In nature, bees have to link hundreds of flowers in a way that minimises travel distance, and then reliably find their way home—not a trivial feat if you have a brain the size of a pinhead! Indeed such travelling salesmen problems keep supercomputers busy for days.’—Professor Lars Chittka, University of London
Such computations “keep supercomputers busy for days”, says Professor Lars Chittka, from the University of London.1 Yet scientists from that university, using artificial computer-generated flowers, have found that bees learn to solve such problems, in effect, and extremely quickly.2 They are the first animals found capable of this—and they solve it for hundreds of locations.
