Human performance on visually presented Traveling Salesman problems

  title={Human performance on visually presented Traveling Salesman problems},
  author={Douglas Vickers and Marcus A. Butavicius and M D Lee and Aleksandr N. Medvedev},
  journal={Psychological Research},
Abstract Little research has been carried out on human performance in optimization problems, such as the Traveling Salesman problem (TSP). Studies by Polivanova (1974, Voprosy Psikhologii, 4, 41–51) and by MacGregor and Ormerod (1996, Perception & Psychophysics, 58, 527–539) suggest that: (1) the complexity of solutions to visually presented TSPs depends on the number of points on the convex hull; and (2) the perception of optimal structure is an innate tendency of the visual system, not… 
Human Performance on Visually Presented Traveling Salesperson Problems with Varying Numbers of Nodes
The most likely polynomial model for describing the relationship between mean solution time and the size of a TSP is linear or near-linear over the range of problem sizes tested, supporting the earlier finding of Graham et al. (2000).
The Perception of Minimal Structures: Performance on Open and Closed Versions of Visually Presented Euclidean Travelling Salesperson Problems
An experiment examines the relationships between three objective measures and performance measures of optimality and response uncertainty in tasks requiring participants to construct a closed tour or an open path and finds results are generally consistent with a locally focused process based initially on the detection of nearest-neighbour clusters.
Convex hull or crossing avoidance? Solution heuristics in the traveling salesperson problem
The crossing avoidance hypothesis was examined from the perspectives of its capacity to explain existing data, its theoretical adequacy, and its ability to explain the results of three new experiments, which were more consistent with the convex hull than with the crossing avoidance hypotheses.
Development of the PEBL Traveling Salesman Problem Computerized Testbed
A computerized version of TSP running in the free and open source Psychology Experiment Building Language (PEBL), designed to be suitable for use within a larger battery of tests, and to examine both standard and custom TSP node configurations (i.e., problems).
Fast and Efficient Discrimination of Traveling Salesperson Problem Stimulus Difficulty
A novel experimental paradigm was employed in which participants were presented with sets of four TSP stimuli that varied in terms of their relative solution difficulty and asked them to indicate which of the four stimuli they would prefer to solve, and results indicated that the participants’ choice frequencies followed the same ordering as the stimuli’s empirical solution difficulty.
Traveling Salesman Problem: A Foveating Pyramid Model
A new version of a pyramid model has an adaptive spatial structure, and it simulates visual acuity and visual attention, and solves the E-TSP problem sequentially by moving attention from city to city, the same way human subjects do.
Although problem solving is an essential expression of intelligence, both experimental and differential psychology have neglected an important class of problems, for which it is difficult or
Running head: CHILDREN AND E-TSP Children’s Performance on the Euclidean Traveling Salesperson Problem
The Euclidean Traveling Salesperson Problem (E-TSP) is a useful task to study how humans optimize when faced with computational intractability. It has been found that humans are capable of finding
The importance of the convex hull for human performance on the traveling salesman problem: A comment on MacGregor and Ormerod (1996)
It is argued that this conclusion is artifactually determined by their constrained procedure for stimulus construction, and, even if true, would be limited to arrays with fewer than around 50 points.
Are Individual Differences in Performance on Perceptual and Cognitive Optimization Problems Determined by General Intelligence?
Modeling of covariance structures indicated that performance on both types of optimization problems relies on general intelligence and raises the possibility that they can be used to assess intelligence.