The roles of the convex hull and the number of potential intersections in performance on visually presented traveling salesperson problems.
The planar Euclidean version of the traveling salesperson problem requires finding the shortest tour through a two-dimensional array of points. MacGregor and Ormerod (1996) have suggested that people solve such problems by using a global-to-local perceptual organizing process based on the convex hull of the array. We review evidence for and against this idea, before considering an alternative, local-to-global perceptual process, based on the rapid automatic identification of nearest neighbors. We compare these approaches in an experiment in which the effects of number of convex hull points and number of potential intersections on solution performance are measured. Performance worsened with more points on the convex hull and with fewer potential intersections. A measure of response uncertainty was unaffected by the number of convex hull points but increased with fewer potential intersections. We discuss a possible interpretation of these results in terms of a hierarchical solution process based on linking nearest neighbor clusters.
Vickers
Douglas
D
Department of Psychology, University of Adelaide, Adelaide, Australia. douglas.vickers@psychology.adelaide.edu.au
Lee
Michael D
MD
Dry
Matthew
M
Hughes
Peter
P
D000293:Adolescent; D000328:Adult; D001288:Attention; D001364:Awareness; D002755:Choice Behavior; D004193:Discrimination Learning; D005260:Female; D006801:Humans; D008297:Male; D009949:Orientation; D010364:Pattern Recognition, Visual; D011340:Problem Solving; D011597:Psychomotor Performance; D012718:Set, Psychology