Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 8 of 8
Full-Text Articles in Entire DC Network
Traveling Salesman Problem: A Foveating Pyramid Model, Zygmunt Pizlo, Emil Stefanov, John Saalweachter, Zheng Li, Yll Haxhimusa, Walter G. Kropatsch
Traveling Salesman Problem: A Foveating Pyramid Model, Zygmunt Pizlo, Emil Stefanov, John Saalweachter, Zheng Li, Yll Haxhimusa, Walter G. Kropatsch
The Journal of Problem Solving
We tested human performance on the Euclidean Traveling Salesman Problem using problems with 6–50 cities. Results confirmed our earlier findings that: (a) the time of solving a problem is proportional to the number of cities, and (b) the solution error grows very slowly with the number of cities. We formulated a new version of a pyramid model. The new model has an adaptive spatial structure, and it simulates visual acuity and visual attention. Specifically, the model solves the E-TSP problem sequentially by moving attention from city to city, the same way human subjects do. The model includes a parameter representing …
Optimizing And “Pessimizing”: Human Performance With Instructional Variants Of The Traveling Salesperson Problem, Edward Chronicle, James Macgregor, Thomas Ormerod
Optimizing And “Pessimizing”: Human Performance With Instructional Variants Of The Traveling Salesperson Problem, Edward Chronicle, James Macgregor, Thomas Ormerod
The Journal of Problem Solving
The two-dimensional Traveling Salesperson Problem (TSP) requires finding the shortest tour through n locations. Untrained adults are adept at the task, and reliably outperform simple construction algorithms for n up to 60. Performance may stem from a specific, inherent ability. Alternatively, it may reflect general spatial intelligence, whether inherent or acquired. If the latter holds, then people should be equally adept at finding longest tours. Two experiments comparing ability in the two tasks found participants significantly better at finding short than long tours. Furthermore, human performance was significantly worse than a simple construction algorithm (furthest-neighbor) for the task of finding …
Perceptual Or Analytical Processing? Evidence From Children's And Adult's Performance On The Euclidean Traveling Salesperson Problem, Iris Van Rooij, Alissa Schactman, Helena Kadlec, Ulrike Stege
Perceptual Or Analytical Processing? Evidence From Children's And Adult's Performance On The Euclidean Traveling Salesperson Problem, Iris Van Rooij, Alissa Schactman, Helena Kadlec, Ulrike Stege
The Journal of Problem Solving
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 proposals: The high quality of performance on E-TSP reflects (a) the output of automatic and innate perceptual processes or (b) a fundamentally intelligent approach to the task by humans. An experiment was performed to compare performance of three age groups (7- year-olds, 12-year-olds, and adults). Our findings …
A Comparison Of Heuristic And Human Performance On Open Versions Of The Traveling Salesperson Problem, James N. Macgregor, Edward P. Chronicle, Thomas C. Ormerod
A Comparison Of Heuristic And Human Performance On Open Versions Of The Traveling Salesperson Problem, James N. Macgregor, Edward P. Chronicle, Thomas C. Ormerod
The Journal of Problem Solving
We compared the performance of three heuristics with that of subjects on variants of a well-known combinatorial optimization task, the Traveling Salesperson Problem (TSP). The present task consisted of finding the shortest path through an array of points from one side of the array to the other. Like the standard TSP, the task is computationally intractable and, as with the standard TSP, people appear to be able to find good solutions with relative ease. The three heuristics used mechanisms that have been cited as potentially relevant in human performance in the standard task. These were: convex hull, nearest neighbor, and …
Human Performance On Visually Presented Traveling Salesperson Problems With Varying Numbers Of Nodes, Matthew Dry, Michael D. Lee, Douglas Vickers, Peter Hughes
Human Performance On Visually Presented Traveling Salesperson Problems With Varying Numbers Of Nodes, Matthew Dry, Michael D. Lee, Douglas Vickers, Peter Hughes
The Journal of Problem Solving
We investigated the properties of the distribution of human solution times for Traveling Salesperson Problems (TSPs) with increasing numbers of nodes. New experimental data are presented that measure solution times for carefully chosen representative problems with 10, 20, . . . 120 nodes. We compared the solution times predicted by the convex hull procedure proposed by MacGregor and Ormerod (1996), the hierarchical approach of Graham, Joshi, and Pizlo (2000), and by five algorithms drawn from the artificial intelligence and operations research literature. The most likely polynomial model for describing the relationship between mean solution time and the size of a …
Are Individual Differences In Performance On Perceptual And Cognitive Optimization Problems Determined By General Intelligence?, Nicholas R. Burns, Michael D. Lee, Douglas Vickers
Are Individual Differences In Performance On Perceptual And Cognitive Optimization Problems Determined By General Intelligence?, Nicholas R. Burns, Michael D. Lee, Douglas Vickers
The Journal of Problem Solving
Studies of human problem solving have traditionally used deterministic tasks that require the execution of a systematic series of steps to reach a rational and optimal solution. Most real-world problems, however, are characterized by uncertainty, the need to consider an enormous number of variables and possible courses of action at each stage in solving the problem, and the need to optimize the solution subject to multiple interacting constraints. There are reliable individual differences in people’s abilities to solve such realistic problems. It also seems likely that people’s ability to solve these difficult problems reflects, or depends on, their intelligence. We …
Editor's Introduction, Zygmunt Pizlo
Editor's Introduction, Zygmunt Pizlo
The Journal of Problem Solving
No abstract provided.