Search PubMed⌕ Search

Biomedical subjects

James N MacGregor

Publications and source records attributed to James N MacGregor.

4 recordsLinked to original sources

It looks easy! Heuristics for combinatorial optimization problems.

Human performance on instances of computationally intractable optimization problems, such as the travelling salesperson problem (TSP), can be excellent. We have proposed a boundary-following heuristic to account for this finding. We report three experiments with TSPs where the capacity to employ this heuristic was varied. In Experiment 1, participants free to use the heuristic produced solutions significantly closer to optimal than did those prevented from doing so. Experiments 2 and 3 together replicated this finding in larger problems and demonstrated that a potential confound had no effect. In all three experiments, performance was closely matched by a boundary-following model. The results implicate global rather than purely local processes. Humans may have access to simple, perceptually based, heuristics that are suited to some combinatorial optimization tasks.

Attention↗

What makes an insight problem? The roles of heuristics, goal conception, and solution recoding in knowledge-lean problems.

Four experiments investigated transformation problems with insight characteristics. In Experiment 1, performance on a version of the 6-coin problem that had a concrete and visualizable solution followed a hill-climbing heuristic. Experiment 2 demonstrated that the difficulty of a version of the problem that potentially required insight for solution stems from the same hill-climbing heuristic, which creates an implicit conceptual block. Experiment 3 confirmed that the difficulty of the potential insight solution is conceptual, not procedural. Experiment 4 demonstrated the same principles of move selection on the 6-coin problem and the 10-coin (triangle) problem. It is argued that hill-climbing heuristics provide a common framework for understanding transformation and insight problem solving. Postsolution receding may account for part of the phenomenology of insight.

Cognition↗

Convex hull or crossing avoidance? Solution heuristics in the traveling salesperson problem.

Untrained adults appear to have access to cognitive processes that allow them to perform well in the Euclidean version of the traveling salesperson problem (E-TSP). They do so despite the famous computational intractability of the problem, which stems from its combinatorial complexity. A current hypothesis is the humans' good performance is based on following a strategy of connecting boundary points in order (the convex hull hypothesis). Recently, an alternative has been proposed, that performance is governed by a strategy of avoiding crossings. We examined the crossing avoidance hypothesis from the perspectives of its capacity to explain existing data, its theoretical adequacy, and its ability to explain the results of three new experiments. In Experiment 1, effects on the solution quality of number of points versus number of interior points were compared. In Experiment 2, the distributions of observed paths were compared with those predicted from the two hypotheses. In Experiment 3, figural effects were varied to induce crossings. The results of the experiments were more consistent with the convex hull than with the crossing avoidance hypothesis. Despite its simplicity and intuitive appeal, crossing avoidance does not provide a complete alternative to the convex hull hypothesis. Further elucidation of human strategies and heuristics for optimization problems such as the E-TSP will aid our understanding of how cognitive processes have adapted to the demands of combinatorial difficulty.

Commerce↗

Dynamics and constraints in insight problem solving.

This article reports 2 experiments that investigated performance on a novel insight problem, the 8-coin problem. The authors hypothesized that participants would make certain initial moves (strategic moves) that seemed to make progress according to the problem instructions but that nonetheless would guarantee failure to solve the problem. Experiment 1 manipulated the starting state of the problem and showed that overall solution rates were lower when such strategic moves were available. Experiment 2 showed that failure to capitalize on visual hints about the correct first move was also associated with the availability of strategic moves. The results are interpreted in terms of an information-processing framework previously applied to the 9-dot problem. The authors argue that in addition to the operation of inappropriate constraints, a full account of insight problem solving must incorporate a dynamic that steers solution-seeking activity toward the constraints.

Attention↗