Home > slashdot > Bees Beat Machines At ‘Traveling Salesman’ Problem

Bees Beat Machines At ‘Traveling Salesman’ Problem

October 25th, 2010 10:40 admin Leave a comment Go to comments

eldavojohn writes “Recent research on bumble bees has proven that the tiny bee is better than computers at the traveling salesman problem. As bees visit flowers to collect nectar and pollen they discover other flowers en route in the wrong order. But they still manage to quickly learn and fly the optimally shortest path between flowers. Such a problem is NP-Hard and keeps our best machines thinking for days searching for a solution but researchers are quite interested how such a tiny insect can figure it out on the fly — especially given how important this problem is to networks and transportation. A testament to the power of even the smallest batch of neurons or simply evidence our algorithms need work?”

Source: Bees Beat Machines At ‘Traveling Salesman’ Problem

Related Articles:

  1. The Physical Travelling Salesman Challenge
  2. Travelling Salesman, Thriller Set In a World Where P=NP
  3. Travelling Salesman, Thriller Set In a World Where P=NP
  4. Insect Character Recognition: Computers See Bees Like We Can’t
  5. Death of the Car Salesman? BMW Makes AI App To Sell Electric Cars
blog comments powered by Disqus
YOYOYOOYOYOYO