| Title |
It looks easy! Heuristics for combinatorial optimization problems
|
|---|---|
| Published in |
Quarterly Journal of Experimental Psychology, April 2006
|
| DOI | 10.1080/02724980543000033 |
| Pubmed ID | |
| Authors |
Edward P. Chronicle, James N. MacGregor, Thomas C. Ormerod, Alistair Burr |
| Abstract |
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. |
Login to access the Attention Digest and the Sentiment Analysis related to this output.
Mendeley demographics
Geographical breakdown
| Country | Count | As % |
|---|---|---|
| Germany | 3 | 15% |
| United States | 1 | 5% |
| Italy | 1 | 5% |
| Unknown | 15 | 75% |
Demographic breakdown
| Readers by professional status | Count | As % |
|---|---|---|
| Student > Ph. D. Student | 4 | 20% |
| Professor | 2 | 10% |
| Student > Master | 2 | 10% |
| Researcher | 2 | 10% |
| Other | 1 | 5% |
| Other | 5 | 25% |
| Unknown | 4 | 20% |
| Readers by discipline | Count | As % |
|---|---|---|
| Psychology | 7 | 35% |
| Computer Science | 3 | 15% |
| Business, Management and Accounting | 2 | 10% |
| Arts and Humanities | 1 | 5% |
| Agricultural and Biological Sciences | 1 | 5% |
| Other | 2 | 10% |
| Unknown | 4 | 20% |