Human performance on the traveling salesman problem

  title={Human performance on the traveling salesman problem},
  author={James N. MacGregor and Thomas C. Ormerod},
  journal={Perception \& Psychophysics},
Two experiments on performance on the traveling salesman problem (TSP) are reported. The TSP consists of finding the shortest path through a set of points, returning to the origin. It appears to be an intransigent mathematical problem, and heuristics have been developed to find approximate solutions. The first experiment used 10-point, the second, 20-point problems. The experiments tested the hypothesis that complexity of TSPs is a function of number of nonboundary points, not total number of… 

Figures, Tables, and Topics from this paper

A Comparison of Heuristic and Human Performance on Open Versions of the Traveling Salesperson Problem
Of the three heuristics compared with that of subjects on variants of a well-known combinatorial optimization task, the Traveling Salesperson Problem, the convex hull appeared to result in the best overall fit with human solutions.
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).
A model of human performance on the traveling salesperson problem
A computational model is proposed of how humans solve the traveling salesperson problem (TSP) and may find better solutions than some conventional heuristic algorithms for solving TSPs, and comparative results are reported that support this suggestion.
Simulating Human Performance on the Traveling Salesman Problem
This paper reports two empirical studies of human performance on the traveling salesman problem (TSP) and several computational simulations of human performance. Human performance was studied using
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.
Global perceptual processing in problem solving: The case of the traveling salesperson
It is argued that global perceptual processing may contribute more generally to problem solving and that human performance can complement computational TSP methods.
The traveling salesman problem: A hierarchical model
A new algorithm is presented, which is based on a hierarchical pyramid architecture, for solving the Euclidean traveling salesman problem (TSP), which is quite similar to the performance of the subjects.
People Efficiently Explore the Solution Space of the Computationally Intractable Traveling Salesman Problem to Find Near-Optimal Tours
The first demonstration of significant performance improvement on the TSP under repetition and feedback and evidence that human problem-solving may exploit the structure of hard problems paralleling behavior of state-of-the-art heuristics are provided.
Spatial and Contextual Factors in Human Performance on the Travelling Salesperson Problem
The results of experiment 1 show that high levels of solution quality are maintained in solving larger TSPs than had been investigated previously with human participants, and that the presence of an implied real-world context in the problems has no effect upon performance.
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).


Geometric Approaches to Solving the Traveling Salesman Problem
Two geometric approaches to solving sequencing problems are described and tested. Both methods have yielded optimal or near optimal solutions in problems where the optimal is known. Further, these
Approximate Traveling Salesman Algorithms
One of the major conclusions is that it is not difficult to get within 2–3% of optimality using a composite heuristic which requires on the order of n3 computations where n is the number of nodes in the network.
On a Linear-Programming, Combinatorial Approach to the Traveling-Salesman Problem
This paper elaborates a method of attack on traveling-salesman problems, proposed by the authors in an earlier paper, in which linear programming is used to reduce the combinatorial magnitude of such
The travelling salesman problem
This book is intended to be a tutorial on how to solve the Travelling Salesman Problem using a variety of techniques and methods.
Algorithms and Complexity
  • H. Wilf
  • Computer Science, Mathematics
    Lecture Notes in Computer Science
  • 1997
A computation that is guaranteed to take at most cn3 time for input of size n will be thought of as an ‘easy’ computation, and one that needs at most n10 time is also easy.
TRAVEL - An interactive travelling salesman problem package for the IBM-personal computer
This note introduces TRAVEL, a software package designed to produce probably good solutions to the Travelling Salesman Problem. The system is menu driven, allows the user to choose among various
An examination of the alleged role of "fixation" in the solution of several "insight" problems.
SUMMARY A series of experiments were conducted to examine the purported role of fixation in the solution of several insight problems, such as the nine-dot and triangle problems. It has been commonly
The Traveling-Salesman Problem
The traveling-salesman problem is that of finding a permutation P = (1 i2 i3 … in) of the integers from 1 through n that minimizes the quantity \documentclass{aastex} \usepackage{amsbsy}
Problem Solving
The first four steps used by experienced problem solvers to understand and define the real problem are given below: collect and analyze information and data.
Computational complexity and natural language
A unified and coherent account emerges of how complexity theory can probe the information-processing structure of grammars, discovering why a grammar is easy or difficult to process and suggesting where to look for additional grammatical constraints.