Home > Research > Publications & Outputs > Convex-hull or crossing-avoidance? : solution h...

Associated organisational unit

View graph of relations

Convex-hull or crossing-avoidance? : solution heuristics in the travelling salesperson problem.

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Published

Standard

Convex-hull or crossing-avoidance? : solution heuristics in the travelling salesperson problem. / MacGregor, James N.; Chronicle, Edward P.; Ormerod, Thomas C.
In: Memory and Cognition, Vol. 32, No. 2, 03.2004, p. 260-270.

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Harvard

APA

Vancouver

Author

Bibtex

@article{cfb89e5a21c54acbad8d9123c8954f56,
title = "Convex-hull or crossing-avoidance? : solution heuristics in the travelling salesperson problem.",
abstract = "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 that 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.",
keywords = "Psychology, Experiments, Cognition & reasoning",
author = "MacGregor, {James N.} and Chronicle, {Edward P.} and Ormerod, {Thomas C.}",
year = "2004",
month = mar,
language = "English",
volume = "32",
pages = "260--270",
journal = "Memory and Cognition",
issn = "0090-502X",
publisher = "Springer New York",
number = "2",

}

RIS

TY - JOUR

T1 - Convex-hull or crossing-avoidance? : solution heuristics in the travelling salesperson problem.

AU - MacGregor, James N.

AU - Chronicle, Edward P.

AU - Ormerod, Thomas C.

PY - 2004/3

Y1 - 2004/3

N2 - 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 that 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.

AB - 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 that 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.

KW - Psychology

KW - Experiments

KW - Cognition & reasoning

M3 - Journal article

VL - 32

SP - 260

EP - 270

JO - Memory and Cognition

JF - Memory and Cognition

SN - 0090-502X

IS - 2

ER -