Is it possible for humans to navigate in the natural environment wherein the path taken between various destinations is 'optimal' in some way? In the domain of optimization this challenge is traditionally framed as the "Traveling Salesman Problem" (TSP). What strategies and ecological considerations are plausible for human navigation? When given a two-dimensional map-like presentation of the destinations, participants solve this optimization exceptionally well (only 2-3% longer than optimum)^1, 2^. In the following experiments we investigate the effect of effort and its environmental affordance on navigation decisions when humans solve the TSP in the natural environment. Fifteen locations were marked on two outdoor lands...
How effective do observers expect other problem solvers to be? What makes a decision seem "human"?" ...
The Traveling Salesman Problem (TSP) is believed to be an intractable problem and have no practicall...
Problems associated with determining optimal routes from one or several depots (origin, home city) t...
According to the number of targets, route planning can be a very complex task. Human navigators, how...
Humans outperform, within limits, most algorithmic solutions in spatial optimization tasks, such as ...
Although the Traveling Salesman Problem (TSP) is an NP-hard problem, human schedulers can find strat...
The two-dimensional Traveling Salesperson Problem (TSP) requires finding the shortest tour through n...
Little research has been carried out on human performance in optimization problems, such as the Trav...
Humans need to solve computationally intractable problems such as visual search, categorization, and...
Humans need to solve computationally intractable problems such as visual search, categorization, and...
We compared the performance of three heuristics with that of subjects on variants of a well-known co...
We compared the performance of three heuristics with that of subjects on variants of a well-known co...
We tested human performance on the Euclidean Traveling Salesman Problem using problems with 6–50 cit...
Two experiments on performance on the traveling salesman problem (TSP) are reported. The TSP consist...
An experiment is reported comparing human performance on two kinds of visually presented traveling s...
How effective do observers expect other problem solvers to be? What makes a decision seem "human"?" ...
The Traveling Salesman Problem (TSP) is believed to be an intractable problem and have no practicall...
Problems associated with determining optimal routes from one or several depots (origin, home city) t...
According to the number of targets, route planning can be a very complex task. Human navigators, how...
Humans outperform, within limits, most algorithmic solutions in spatial optimization tasks, such as ...
Although the Traveling Salesman Problem (TSP) is an NP-hard problem, human schedulers can find strat...
The two-dimensional Traveling Salesperson Problem (TSP) requires finding the shortest tour through n...
Little research has been carried out on human performance in optimization problems, such as the Trav...
Humans need to solve computationally intractable problems such as visual search, categorization, and...
Humans need to solve computationally intractable problems such as visual search, categorization, and...
We compared the performance of three heuristics with that of subjects on variants of a well-known co...
We compared the performance of three heuristics with that of subjects on variants of a well-known co...
We tested human performance on the Euclidean Traveling Salesman Problem using problems with 6–50 cit...
Two experiments on performance on the traveling salesman problem (TSP) are reported. The TSP consist...
An experiment is reported comparing human performance on two kinds of visually presented traveling s...
How effective do observers expect other problem solvers to be? What makes a decision seem "human"?" ...
The Traveling Salesman Problem (TSP) is believed to be an intractable problem and have no practicall...
Problems associated with determining optimal routes from one or several depots (origin, home city) t...