To explain human performance on the Traveling Salesperson problem (TSP), MacGregor, Ormerod, and Chronicle (2000) proposed that humans construct solutions according to the steps described by their convex-hull algorithm. Focusing on tour length as the dependent variable, and using only random or semirandom point sets, the authors claimed empiri-cal support for their model. In this paper we argue that the empirical tests performed by MacGregor et al. do not constitute support for the model, because they instantiate what Meehl (1997) coined "weak tests " (i.e., tests with a high probability of yielding confi rma-tion even if the model is false). To perform "strong " tests of the model, we implemented the algorithm in a comp...
We investigated the properties of the distribution of human solution times for Traveling Salesperson...
The two-dimensional Traveling Salesperson Problem (TSP) requires finding the shortest tour through n...
The planar Euclidean version of the traveling salesperson problem requires finding the shortest tour...
To explain human performance on the Traveling Salesperson problem (TSP), MacGregor, Ormerod, and Chr...
To explain human performance on the Traveling Salesperson problem (TSP), MacGregor, Ormerod, and Chr...
To explain human performance on the Traveling Salesperson problem (TSP), MacGregor, Ormerod, and Chr...
Recently there has been growing interest among psychologists in human performance on the Euclidean t...
Lee and Vickers (2000) suggest that the results of MacGregor and Ormerod (1996), showing that the re...
We investigated the properties of the distribution of human solution times for Traveling Salesperson...
Untrained adults appear to have access to cognitive processes that allow them to perform well in the...
Untrained adults appear to have access to cognitive processes that allow them to perform well in the...
A computational model is proposed of how humans solve the traveling salesperson problem (TSP). Tests...
We compared the performance of three heuristics with that of subjects on variants of a well-known co...
We investigate the properties of the distribution of human solution times for Traveling Salesperson ...
The Travelling Salesperson Problem (TSP) describes a situation where an imaginary individual wishes ...
We investigated the properties of the distribution of human solution times for Traveling Salesperson...
The two-dimensional Traveling Salesperson Problem (TSP) requires finding the shortest tour through n...
The planar Euclidean version of the traveling salesperson problem requires finding the shortest tour...
To explain human performance on the Traveling Salesperson problem (TSP), MacGregor, Ormerod, and Chr...
To explain human performance on the Traveling Salesperson problem (TSP), MacGregor, Ormerod, and Chr...
To explain human performance on the Traveling Salesperson problem (TSP), MacGregor, Ormerod, and Chr...
Recently there has been growing interest among psychologists in human performance on the Euclidean t...
Lee and Vickers (2000) suggest that the results of MacGregor and Ormerod (1996), showing that the re...
We investigated the properties of the distribution of human solution times for Traveling Salesperson...
Untrained adults appear to have access to cognitive processes that allow them to perform well in the...
Untrained adults appear to have access to cognitive processes that allow them to perform well in the...
A computational model is proposed of how humans solve the traveling salesperson problem (TSP). Tests...
We compared the performance of three heuristics with that of subjects on variants of a well-known co...
We investigate the properties of the distribution of human solution times for Traveling Salesperson ...
The Travelling Salesperson Problem (TSP) describes a situation where an imaginary individual wishes ...
We investigated the properties of the distribution of human solution times for Traveling Salesperson...
The two-dimensional Traveling Salesperson Problem (TSP) requires finding the shortest tour through n...
The planar Euclidean version of the traveling salesperson problem requires finding the shortest tour...