Human Performance on Visually Presented Traveling Salesperson Problems with Varying Numbers of Nodes

No abstract is available for this paper.

• Publication year

  2006

• Venue

  Journal of Problem Solving

• Publication date

  2006-12-05

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.7771/1932-6246.1004
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Intelligence and individual differences in performance on three types of visually presented optimisation problems

  2004cited by this paper
• Some psychophysical determinants of discrete Moiré patterns

  2004cited by this paper
• The roles of the convex hull and the number of potential intersections in performance on visually presented traveling salesperson problems

  2003cited by this paper
• Convex hull and tour crossings in the Euclidean traveling salesperson problem: Implications for human performance studies

  2003cited by this paper
• The Perception of Minimal Structures: Performance on Open and Closed Versions of Visually Presented Euclidean Travelling Salesperson Problems

  2003cited by this paper
• Human performance on visually presented Traveling Salesman problems

  2001cited by this paper
• The traveling salesman problem: A hierarchical model

  2000influential reference
• A model of human performance on the traveling salesperson problem

  2000cited by this paper
• The importance of the convex hull for human performance on the traveling salesman problem: A comment on MacGregor and Ormerod (1996)

  2000cited by this paper
• Spatial and Contextual Factors in Human Performance on the Travelling Salesperson Problem

  1999influential reference
• Simple Heuristics That Make Us Smart

  1999cited by this paper
• The detection of structure in glass patterns: psychophysics and computational models.

  1997cited by this paper
• Computing Bayes Factors by Combining Simulation and Asymptotic Approximations

  1997cited by this paper
• Human performance on the traveling salesman problem

  1996cited by this paper
• The travelling salesman, computational solutions for TSP applications

  1996cited by this paper
• Bayes factors

  1995cited by this paper
• Numerical Recipes in FORTRAN - The Art of Scientific Computing 2nd Ed. (W. H. Press, W. T. Vetterling, S. A. Teukolsky and B. P. Flannery)

  1994cited by this paper
• The traveling salesman: computational solutions for TSP applications

  1994cited by this paper
• Numerical Recipes in Fortran: The Art of Scientific Computing.@@@Numerical Recipes in C: The Art of Scientific Computing.

  1994cited by this paper
• Numerical recipes in Fortran (The art of scientific computing) : W.H. Press, S.A. Teukolsky, W.T. Vetterling and B.P. Flannery, Cambridge Univ. Press, Cambridge, 2nd ed., 1992. 963 pp., US$49.95, ISBN 0-521-43064-X.☆

  1993cited by this paper
• Erratum: The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization

  1986cited by this paper
• Approximate Traveling Salesman Algorithms

  1980cited by this paper
• Estimating the Dimension of a Model

  1978cited by this paper
• Theory of Probability

  year unknowncited by this paper

• Extensions to Competitive Facility Location with Multi-purpose Trips

  2024cites this paper
• The emergence of enhanced intelligence in a brain-inspired cognitive architecture

  2024cites this paper
• Aplicación del modelo TSP en la planificación de rutas de una empresa de servicio de limpieza

  2023cites this paper
• Interplay of Human and AI Solvers on a Planning Problem

  2023cites this paper
• APPLICATION OF GENETIC ALGORITHMS TO THE TRAVELING SALESMAN PROBLEM

  2023cites this paper
• The scaling of mental computation in a sorting task.

  2023cites this paper
• Harnessing Computational Complexity Theory to Model Human Decision-making and Cognition

  2023cites this paper
• Perceived optimality of competing solutions to the Euclidean travelling salesperson problem

  2022cites this paper
• Traveling Salesperson Problem with Simple Obstacles: The Role of Multidimensional Scaling and the Role of Clustering

  2022influential citation
• Vaximap: route optimisation for housebound vaccination

  2022cites this paper
• The neural dynamics associated with computational complexity

  2022cites this paper
• Incorporating Intuition in Last-Mile Routing

  2021cites this paper
• Learn global and optimize local: A data-driven methodology for last-mile routing

  2021cites this paper
• VaxiMap: optimal delivery of vaccinations for housebound patients

  2021cites this paper
• Comparison of eleven measures for estimating difficulty of open-loop TSP instances

  2021cites this paper
• Generic properties of a computational task predict human effort and performance

  2021cites this paper
• When is Psychology Research Useful in Artificial Intelligence? A Case for Reducing Computational Complexity in Problem Solving

  2021cites this paper
• Task-independent metrics of computational hardness predict human cognitive performance

  2021cites this paper
• Structural properties of individual instances predict human effort and performance on an NP-Hard problem

  2020cites this paper
• Analysis and Augmentation of Human Performance on Telerobotic Search Problems

  2020cites this paper
• Experimental Study and Modeling of Three Classes of Collective Problem-Solving Methods

  2020cites this paper
• Where Do You Think You're Going?

  2020cites this paper
• Reflections and Elaborations

  2019cites this paper
• Parameterized Reductions

  2019cites this paper
• Compendium of Complexity Results

  2019cites this paper
• Mathematical Background

  2019cites this paper
• Supporting Humans in Solving Multi-UAV Dynamic Vehicle Routing Problems

  2019cites this paper
• Preface

  2019cites this paper
• Concepts and Techniques

  2019cites this paper
• Search as a simple take-the-best heuristic

  2019cites this paper
• Quotient algorithm: a simple heuristic for the travelling salesperson problem inspired by human solutions

  2019cites this paper
• Enabling Humans to Plan Inspection Paths Using a Virtual Reality Interface

  2019cites this paper
• PathGame: Crowdsourcing Time-Constrained Human Solutions for the Travelling Salesperson Problem

  2019influential citation
• Cognition and intractability: a guide to classical and parameterized complexity analysis

  2019cites this paper
• Polynomial versus Exponential Time

  2019cites this paper
• Analogy as Structure Mapping

  2019cites this paper
• Introduction

  2019cites this paper
• Introduction

  2019cites this paper
• Dealing with Intractability

  2019cites this paper
• References

  2019cites this paper
• Replies to Common Objections

  2019cites this paper
• Communication as Bayesian Inference

  2019cites this paper
• Index

  2019cites this paper
• Polynomial-Time Reductions

  2019cites this paper
• List of Computational Problems

  2019cites this paper
• Fixed-Parameter Tractable Time

  2019cites this paper
• Classical Complexity Classes

  2019cites this paper
• Predicting the difficulty of TSP instances using MST

  2019influential citation
• Parameterized Complexity Classes

  2019cites this paper
• Human behaviour in the Euclidean Travelling Salesperson Problem: Computational modelling of heuristics and figural effects

  2018cites this paper
• The Role of the Goal in Solving Hard Computational Problems: Do People Really Optimize?

  2018cites this paper
• Virtual, Augmented and Mixed Reality: Interaction, Navigation, Visualization, Embodiment, and Simulation

  2018cites this paper
• Quantifying Human Decision-Making: Implications for Bidirectional Communication in Human-Robot Teams

  2018cites this paper
• Heuristics for Comparing the Lengths of Completed E-TSP Tours: Crossings and Areas

  2018cites this paper
• One Intelligent Agent to Rule Them All Bachelor Thesis

  2018cites this paper
• Planning Your Route: Where to Start?

  2018cites this paper
• Quotient Algorithm: A Simple Human-Inspired Heuristic for Addressing the Travelling Salesperson Problem

  2018cites this paper
• Where the really hard choices are: A general framework to quantify decision difficulty

  2018cites this paper
• Acknowledging crossing-avoidance heuristic violations when solving the Euclidean travelling salesperson problem

  2017influential citation
• Mental Model Consensus and Shifts During Navigation System-Assisted Route Planning

  2017cites this paper
• Considerations Influencing Human TSP Solutions and Modeling Implications

  2016cites this paper
• High Dimensional Human Guided Machine Learning

  2016cites this paper
• Modelling human problem solving with data from an online game

  2016cites this paper
• A Computational Model for Estimating the Difficulty of Chess Problems

  2015cites this paper
• Effects of cluster location and cluster distribution on performance on the traveling salesman problem

  2015cites this paper
• Development of the PEBL Traveling Salesman Problem Computerized Testbed

  2015influential citation
• The spatio-temporal distribution of honey bees and floral resources in Australia

  2015cites this paper
• Assessing the Difficulty of Chess Tactical Problems

  2014cites this paper
• Difficulty Rating of Sudoku Puzzles: An Overview and Evaluation

  2014cites this paper
• Using Turing Oracles in Cognitive Models of Problem-Solving

  2014cites this paper
• Performance of Young Children on ‘‘Traveling Salesperson’’ Navigation Tasks Presented on a Touch Screen

  2014cites this paper
• Fast and Efficient Discrimination of Traveling Salesperson Problem Stimulus Difficulty

  2014cites this paper
• On Evaluating Human Problem Solving of Computationally Hard Problems

  2013cites this paper
• Approches générales de résolution pour les problèmes multi-attributs de tournées de véhicules et confection d'horaires

  2013cites this paper
• Computation of the travelling salesman problem by a shrinking blob

  2013cites this paper
• Search-Based Estimation of Problem Difficulty for Humans

  2013cites this paper
• Solving Large Problems with a Small Working Memory

  2013influential citation
• Comparing Problem Solving Strategies for NP-hard Optimization Problems

  2013cites this paper
• Clustering, Randomness, and Regularity: Spatial Distributions and Human Performance on the Traveling Salesperson Problem and Minimum Spanning Tree Problem

  2012influential citation
• Indentations and Starting Points in Traveling Sales Tour Problems: Implications for Theory

  2012cites this paper
• Human Performance on Hard Non-Euclidean Graph Problems: Vertex Cover

  2012cites this paper
• Dose-Related Effects of Alcohol on Cognitive Functioning

  2012cites this paper
• The Wisdom of the Crowd in Combinatorial Problems

  2012cites this paper
• 2D and 3D Traveling Salesman Problem

  2011cites this paper
• Anchoring in the Lead-Time Time Trade-Off : does the “Starting-point” influence preference elicitation?

  2011cites this paper
• Why Vote-seeking Parties May Make Voters Miserable

  2011cites this paper
• 2 D and 3 D Traveling Salesman Problem

  2011cites this paper
• Towards a Cognitive Model for Human Wayfinding Behavior in Regionalized Environments

  2011cites this paper
• Human Performance on the Traveling Salesman and Related Problems: A Review

  2011cites this paper
• Minimal Paths in the City Block: Human Performance on Euclidean and Non-Euclidean Traveling Salesperson Problems

  2010cites this paper
• Wisdom of the Crowds in TSP 1 Running Head : WISDOM OF THE CROWDS IN TSP Wisdom of the Crowds in Traveling Salesman Problems

  2010cites this paper
• Human Problem Solving : Sudoku Case Study ∗

  2010cites this paper
• Determining Degree Of Difficulty In Rogo, A TSP-based Paper Puzzle

  2010cites this paper
• Human Problem Solving : Sokoban Case Study

  2010cites this paper
• Difficulty Rating of Sokoban Puzzle 1

  2010cites this paper
• Wisdom of the Crowds in Minimum Spanning Tree Problems

  2010cites this paper
• The Traveling Salesman Problem in the Natural Environment

  2010cites this paper
• P, NP, and NP-Completeness: Polynomial-time Reductions

  2010cites this paper
• Difficulty Rating of Sokoban Puzzle

  2010cites this paper
• Planning paths to multiple targets: memory involvement and planning heuristics in spatial problem solving

  2009cites this paper