Literature DB >> 10497439

Global perceptual processing in problem solving: the case of the traveling salesperson.

T C Ormerod1, E P Chronicle.   

Abstract

The traveling salesperson problem (TSP) consists of finding the shortest tour around a set of locations and is an important task in computer science and operations research. In four experiments, the relationship between processes implicated in the recognition of good figures and the identification of TSP solutions was investigated. In Experiment 1, a linear relationship was found between participants' judgments of good figure and the optimality of solutions to TSPs. In Experiment 2, identification performance was shown to be a function of solution optimality and problem orientation. Experiment 3 replicated these findings with a forced-pace method, suggesting that global processing, rather than a local processing strategy involving point-by-point analysis of TSP solutions, is the primary process involved in the derivation of best figures for the presented TSPs. In Experiment 4, the role of global precedence was confirmed using a priming method, in which it was found that short (100 msec) primes facilitated solution identification, relative to no prime or longer primes. Effects of problem type were found in all the experiments, suggesting that local features of some problems may disrupt global processing. The results are discussed in terms of Sanocki's (1993) global-to-local contingency model. We argue that global perceptual processing may contribute more generally to problem solving and that human performance can complement computational TSP methods.

Entities:  

Mesh:

Year:  1999        PMID: 10497439     DOI: 10.3758/bf03207625

Source DB:  PubMed          Journal:  Percept Psychophys        ISSN: 0031-5117


  10 in total

1.  The traveling salesman problem: a hierarchical model.

Authors:  S M Graham; A Joshi; Z Pizlo
Journal:  Mem Cognit       Date:  2000-10

2.  Conceptual layers and strategies in tour planning.

Authors:  Thora Tenbrink; Inessa Seifert
Journal:  Cogn Process       Date:  2010-10-13

3.  Acknowledging crossing-avoidance heuristic violations when solving the Euclidean travelling salesperson problem.

Authors:  Markos Kyritsis; Stephen R Gulliver; Eva Feredoes
Journal:  Psychol Res       Date:  2017-06-12

4.  A model of human performance on the traveling salesperson problem.

Authors:  J N MacGregor; T C Ormerod; E P Chronicle
Journal:  Mem Cognit       Date:  2000-10

5.  People efficiently explore the solution space of the computationally intractable traveling salesman problem to find near-optimal tours.

Authors:  Daniel E Acuña; Víctor Parada
Journal:  PLoS One       Date:  2010-07-29       Impact factor: 3.240

6.  Convex hull or crossing avoidance? Solution heuristics in the traveling salesperson problem.

Authors:  James N MacGregor; Edward P Chronicle; Thomas C Ormerod
Journal:  Mem Cognit       Date:  2004-03

7.  Convex hull and tour crossings in the Euclidean traveling salesperson problem: implications for human performance studies.

Authors:  Iris Van Rooij; Ulrike Stege; Alissa Schactman
Journal:  Mem Cognit       Date:  2003-03

8.  A comparison of human performance in figural and navigational versions of the traveling salesman problem.

Authors:  R E Blaser; Julie Wilber
Journal:  Psychol Res       Date:  2012-12-25

9.  Performance of young children on ''traveling salesperson'' navigation tasks presented on a touch screen.

Authors:  Hiromitsu Miyata; Shigeru Watanabe; Yasuyo Minagawa
Journal:  PLoS One       Date:  2014-12-18       Impact factor: 3.240

10.  Vervet monkeys use paths consistent with context-specific spatial movement heuristics.

Authors:  Julie A Teichroeb
Journal:  Ecol Evol       Date:  2015-10-05       Impact factor: 2.912

  10 in total

北京卡尤迪生物科技股份有限公司 © 2022-2023.