We investigated human performance on the Euclidean Traveling Salesperson Problem (TSP) and Euclidean Minimum Spanning Tree Problem (MST-P) in regards to a factor that has previously received little attention within the literature: the spatial distributions of TSP and MST-P stimuli. First, we describe a method for quantifying the relative degree of…

The Traveling Salesperson Problem (TSP) is a computationally difficult combinatorial optimization problem. In spite of its relative difficulty, human solvers are able to generate close-to-optimal solutions in a close-to-linear time frame, and it has been suggested that this is due to the visual system's inherent sensitivity to certain geometric…

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,…

We consider group decision-making on an optimal stopping problem, for which large and stable individual differences have previously been established. In the problem, people are presented with a sequence of five random numbers between 0 and 100, one at a time, and are required to choose the maximum of the sequence, without being allowed to return…

The Euclidean Traveling Salesperson Problem (E-TSP) is a useful task to study how humans optimize when faced with computational intractability. It has been found that humans are capable of finding high-quality solutions for E-TSP in a relatively short time and with seemingly little cognitive effort. This observation has led to two general…