Lancaster EPrints

A comparison of heuristic and human performance on open versions of the traveling salesperson problem.

MacGregor, James N. and Chronicle, Edward P. and Ormerod, ThomasC. (2006) A comparison of heuristic and human performance on open versions of the traveling salesperson problem. Journal of Problem Solving, 1 (1). pp. 33-43. ISSN 1932-6246

[img]
Preview
PDF (TomOrmerod20071220T113800.pdf)
Download (121Kb) | Preview

    Abstract

    We compared the performance of three heuristics with that of subjects on variants of a well-known combinatorial optimization task, the Traveling Salesperson Problem (TSP). The present task consisted of finding the shortest path through an array of points from one side of the array to the other. Like the standard TSP, the task is computationally intractable and, as with the standard TSP, people appear to be able to find good solutions with relative ease. The three heuristics used mechanisms that have been cited as potentially relevant in human performance in the standard task. These were: convex hull, nearest neighbor, and crossing avoidance. We compared heuristic and human performance in terms of lengths of paths, overlap between solutions, and number of crossings. Of the three heuristics, the convex hull appeared to result in the best overall fit with human solutions.

    Item Type: Article
    Journal or Publication Title: Journal of Problem Solving
    Subjects: B Philosophy. Psychology. Religion > BF Psychology
    Departments: Faculty of Science and Technology > Psychology
    ID Code: 10049
    Deposited By: Prof Tom Ormerod
    Deposited On: 07 Jul 2008 10:11
    Refereed?: Yes
    Published?: Published
    Last Modified: 17 Sep 2013 08:15
    Identification Number:
    URI: http://eprints.lancs.ac.uk/id/eprint/10049

    Actions (login required)

    View Item