Please use this identifier to cite or link to this item:
|Title:||Minimal paths in the city block: Human performance on Euclidean and non-Euclidean travelling salesperson problems|
|Citation:||The Journal of Problem Solving, 2010; 3(1):1-12|
|Publisher:||Purdue University Press|
|Amy L. Walwyn and Daniel J. Navarro|
|Abstract:||An experiment is reported comparing human performance on two kinds of visually presented traveling salesperson problems (TSPs), those reliant on Euclidean geometry and those reliant on city block geometry. Across multiple array sizes, human performance was near-optimal in both geometries, but was slightly better in the Euclidean format. Even so, human solutions varied systematically across geometries, with the differences reflecting sensible adaptations to the different distance structures that these geometries imply. These results suggest that human near-optimality for visually presented TSPs may apply to a more general class of problems than the standard Euclidean case.|
|Keywords:||optimization; traveling salesperson problem; visual perception|
|Rights:||Copyright status unknown|
|Appears in Collections:||Psychology publications|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.