It looks easy! Heuristics for combinatorial optimization problems.

Chronicle, Edward P. and MacGregor, James N. and Ormerod, Thomas C. and Burr, Alistair (2006) It looks easy! Heuristics for combinatorial optimization problems. The Quarterly Journal of Experimental Psychology, 39 (4). 783 -800. ISSN 1747-0218

Full text not available from this repository.


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.

Item Type:
Journal Article
Journal or Publication Title:
The Quarterly Journal of Experimental Psychology
Uncontrolled Keywords:
ID Code:
Deposited By:
Deposited On:
21 May 2008 14:55
Last Modified:
21 Nov 2022 20:45