A model of human performance on the traveling salesperson problem
Related Experiment Video
Updated: Oct 10, 2026

Spotlighting Customers' Visual Attention at the Stock, Shelf and Store Levels with the 3S Model
Published on: May 24, 2019
J N MacGregor1, T C Ormerod, E P Chronicle
1University of Victoria, Victoria, British Columbia, Canada. jmacgreg@uvic.ca
Abstract:
A computational model is proposed of how humans solve the traveling salesperson problem (TSP). Tests of the model are reported, using human performance measures from a variety of 10-, 20-, 40-, and 60-node problems, a single 48-node problem, and a single 100-node problem. The model provided a range of solutions that approximated the range of human solutions and conformed closely to quantitative and qualitative characteristics of human performance. The minimum path lengths of subjects and model deviated by average absolute values of 0.0%, 0.9%, 2.4%, 1.4%, 3.5%, and 0.02% for the 10-, 20-, 40-, 48-, 60-, and 100-node problems, respectively. Because the model produces a range of solutions, rather than a single solution, it may find better solutions than some conventional heuristic algorithms for solving TSPs, and comparative results are reported that support this suggestion.
Related Concept Videos
Growth Models with Integration: Problem Solving
Mathematical Modeling: Problem Solving
Principle of Virtual Work: Problem Solving
To apply the principle of virtual work,...
Distributed Loads: Problem Solving
Two-Dimensional Force System: Problem Solving
The first step to solving a two-dimensional force system problem is to draw a free-body diagram of the object under consideration. This diagram helps identify all the external forces acting on the object, including their...
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
