Little research has been carried out on human performance in optimization problems, such as the Traveling Salesman problem (TSP). Studies by Polivanova (1974, Voprosy Psikhologii, 4, 41–51) and by MacGregor and Ormerod (1996, Perception & Psychophysics, 58, 527–539) suggest that: (1) the complexity of solutions to visually presented TSPs depends on the number of points on the convex hull; and (2) the perception of optimal structure is an innate tendency of the visual system, not subject to individual differences. Results are reported from two experiments. In the first, measures of the total length and completion speed of pathways, and a measure of path uncertainty were compared with optimal solutions produced by an elastic net algorithm and...
Humans need to solve computationally intractable problems such as visual search, categorization, and...
The traveling salesman problem (TSP) is a combinatorial optimization problem that requires finding t...
Results on human performance on the Traveling Salesman Problem (TSP) from different laboratories sho...
Two experiments on performance on the traveling salesman problem (TSP) are reported. The TSP consist...
The Travelling Salesperson Problem (TSP) is a computationally difficult combinatorial optimization p...
The article provides a review of recent research on human performance on the traveling salesman prob...
The Travelling Salesperson Problem (TSP) is a computationally difficult combinatorial optimization p...
How effective do observers expect other problem solvers to be? What makes a decision seem "human"?" ...
We compared the performance of three heuristics with that of subjects on variants of a well-known co...
Studies of human problem solving have traditionally used deterministic tasks that re-quire the execu...
We compared the performance of three heuristics with that of subjects on variants of a well-known co...
The Travelling Salesperson Problem (TSP) is a nondeterministic-polynomial hard (NP-hard) combinatori...
We compared the performance of three heuristics with that of subjects on variants of a well-known co...
Results on human performance on the Traveling Salesman Problem (TSP) from different laboratories sho...
Humans outperform, within limits, most algorithmic solutions in spatial optimization tasks, such as ...
Humans need to solve computationally intractable problems such as visual search, categorization, and...
The traveling salesman problem (TSP) is a combinatorial optimization problem that requires finding t...
Results on human performance on the Traveling Salesman Problem (TSP) from different laboratories sho...
Two experiments on performance on the traveling salesman problem (TSP) are reported. The TSP consist...
The Travelling Salesperson Problem (TSP) is a computationally difficult combinatorial optimization p...
The article provides a review of recent research on human performance on the traveling salesman prob...
The Travelling Salesperson Problem (TSP) is a computationally difficult combinatorial optimization p...
How effective do observers expect other problem solvers to be? What makes a decision seem "human"?" ...
We compared the performance of three heuristics with that of subjects on variants of a well-known co...
Studies of human problem solving have traditionally used deterministic tasks that re-quire the execu...
We compared the performance of three heuristics with that of subjects on variants of a well-known co...
The Travelling Salesperson Problem (TSP) is a nondeterministic-polynomial hard (NP-hard) combinatori...
We compared the performance of three heuristics with that of subjects on variants of a well-known co...
Results on human performance on the Traveling Salesman Problem (TSP) from different laboratories sho...
Humans outperform, within limits, most algorithmic solutions in spatial optimization tasks, such as ...
Humans need to solve computationally intractable problems such as visual search, categorization, and...
The traveling salesman problem (TSP) is a combinatorial optimization problem that requires finding t...
Results on human performance on the Traveling Salesman Problem (TSP) from different laboratories sho...