It looks easy! Heuristics for combinatorial optimization problems.

  title={It looks easy! Heuristics for combinatorial optimization problems.},
  author={Edward P. Chronicle and James N. MacGregor and Thomas C. Ormerod and Alistair Burr},
  journal={Quarterly journal of experimental psychology},
  volume={59 4},
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… CONTINUE READING
Highly Cited
This paper has 26 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.


Publications citing this paper.
Showing 1-10 of 11 extracted citations


Publications referenced by this paper.
Showing 1-10 of 30 references

Human performance on the Euclidean p-median problem

  • M. Brusco
  • Unpublished manuscript.
  • 2001
Highly Influential
5 Excerpts

Eye scanning and visual search

  • J. M. Findlay
  • J. M. Henderson & F. Ferreira (Eds.) The…
  • 2003
2 Excerpts

Similar Papers

Loading similar papers…