People efficiently explore the solution space of the computationally intractable traveling salesman problem to find near-optimal tours.

Humans need to solve computationally intractable problems such as visual search, categorization, and simultaneous learning and acting, yet an increasing body of evidence suggests that their solutions to instantiations of these problems are near optimal. Computational complexity advances an explanati...

Full description

Bibliographic Details
Main Authors: Daniel E Acuña, Víctor Parada
Format: Article
Language:English
Published: Public Library of Science (PLoS) 2010-07-01
Series:PLoS ONE
Online Access:http://europepmc.org/articles/PMC2912227?pdf=render