Human performance on the traveling salesman problem
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 points. Both experiments supported the hypothesis. The experiments provided information on the quality of subjects’ solutions. Their solutions clustered close to the best known solutions, were an order of magnitude better than solutions produced by three well-known heuristics, and on average fell beyond the 99.9th percentile in the distribution of random solutions. The solution process appeared to be perceptually based.
References Attneave, F. (1982). Prägnanz and soap-bubble systems: A theoretical exploration. In J. Beck (Ed.), Organization and representation in perception (pp. 11-29). Hillsdale, NJ: Erlbaum.
- Barton, G. E., Jr.,Berwick, R. C., &Ristad, E. S. (1987).Computational complexity and natural language. Cambridge, MA: MIT Press.Google Scholar
- Buckmaster, J. K. (1992).Evaluating human performance on the travelling salesman problem using a Hypercard based system. Unpublished master’s thesis, Loughborough University of Technology.Google Scholar
- Larkin, J. H. (1989). Display-based problem solving. In D. Klahr & K. Kotovsky (Eds.),Complex information processing (pp. 319–341). Hillsdale, NJ: Erlbaum.Google Scholar
- Lee, R. K. L. (1985).A heuristic approach to the travelling salesman problem [Unpublished Management Report]. University of Victoria, School of Public Administration.Google Scholar
- Michie, D., Fleming, J. G., &Oldfield, J. V. (1968). A comparison of heuristic, interactive and unaided methods of solving a shortestroute problem. In D. Michie (Ed.),Machine intelligence (pp. 245–255). New York: Elsevier.Google Scholar
- Ormerod, T. C., & Chronicle, E. (1995, September).Rapid solution to perceptually presented intransigent problems: The case of the travelling salesman. Paper presented at the British Psychological Society Cognitive Section Conference, Bristol.Google Scholar
- Polivanova, N. I. (1974). On some functional and structural features of the visual-intuitive components of a problem-solving process.Voprosy Psikhologii [Questions of Psychology],4, 41–51.Google Scholar
- Pomerantz, J. R. (1981). Perceptual organization and information processing. In M. Kubovy & J. R. Pomerantz (Eds.),Perceptual organization (pp. 141–180). Hillsdale, NJ: Erlbaum.Google Scholar
- Sangalli, A. (1992, December 12). Why sales reps pose a hard problem.New Scientist, pp. 24–28.Google Scholar
- Wilf, H. S. (1986).Algorithms and complexity. Englewood Cliffs, NJ: Prentice-Hall.Google Scholar