A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is
We compared the performance of three heuristics with that of subjects on variants of a well-known combinatorial optimization task, the Traveling Salesperson Problem (TSP). The present task consisted of finding the shortest path through an array of points from one side of the array to the other. Like the standard TSP, the task is computationally intractable and, as with the standard TSP, people appear to be able to find good solutions with relative ease. The three heuristics used mechanisms thatdoi:10.7771/1932-6246.1005 fatcat:jxcvcfpfo5d4rpzrcowzly32gu