Forgot your password?
typodupeerror
Education

+ - Bees Beat Machines at 'Traveling Salesman' Problem->

Submitted by eldavojohn
eldavojohn (898314) 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?"
Link to Original Source
This discussion was created for logged-in users only, but now has been archived. No new comments can be posted.

Bees Beat Machines at 'Traveling Salesman' Problem

Comments Filter:

Entropy isn't what it used to be.

Working...