Human behaviour in the Euclidean Travelling Salesperson Problem: Computational modelling of heuristics and figural effects

  title={Human behaviour in the Euclidean Travelling Salesperson Problem: Computational modelling of heuristics and figural effects},
  author={Markos Kyritsis and Stephen R. Gulliver and Eva Feredoes and Shahab Ud Din},
  journal={Cognitive Systems Research},
Abstract The Travelling Salesperson Problem (TSP) describes a situation where an imaginary individual wishes to visit multiple cities once before returning to his/her own city. This type of problem is known as a nondeterministic polynomial (NP) hard problem, since the factorial number of solutions results in it being impractical to solve using exhaustive processing. Interestingly, when presented as a Euclidean graph (i.e., ETSP), humans identify near optimal solutions almost effortlessly… 
A Construction Tour Technique For Solving The Travelling Salesman Problem Based On Convex Hull And Nearest Neighbour Heuristics
  • E. Asani, A. Okeyinka, A. Adebiyi
  • Computer Science
    2020 International Conference in Mathematics, Computer Engineering and Computer Science (ICMCECS)
  • 2020
The experimental results show that the hybrid heuristic outperforms both NN and NI both in terms of computational speed and closeness to the optimal solution.
Analysis of Human Performance in the Solution of Traveling Salesman Problem
Whether gender and education level had an impact on the quality of the solution of TSP was analyzed and the basis for the visual and spatial solution of many optimization problems was found.
Air Surveillance Planning Approach for Large Areas
The approach is presented aim to maximize the gain of the trajectory in each group of points that belongs to a part of the surveillance area, with the limit budget the authors have.
Eurasian Journal of Educational Research
Article History: Purpose: The present study aims to investigate the level of teachers' organizational citizenship behaviors and counter-productive work behaviors (CWBs) based on public primary school
Performance Evaluation of Convex Hull Node-Based Heuristics for Solving the Travelling Salesman Problem


Acknowledging crossing-avoidance heuristic violations when solving the Euclidean travelling salesperson problem
This study systematically investigates whether the occurrence of crossings is impacted by geometric properties by modelling their relationship using binomial logistic regression as well as random forests, and shows that properties, such as the number of nodes making up the convex hull, are significant predictors of whether crossings are likely to occur.
Human Performance on Visually Presented Traveling Salesperson Problems with Varying Numbers of Nodes
The most likely polynomial model for describing the relationship between mean solution time and the size of a TSP is linear or near-linear over the range of problem sizes tested, supporting the earlier finding of Graham et al. (2000).
Sense of direction and conscientiousness as predictors of performance in the Euclidean travelling salesman problem
This study provides evidence to suggest that human solutions to the ETSP are significantly affected by individual differences, including personality and cognitive traits, as well as a key metric of graph optimality.
TSPInfrastructure for the Traveling Salesperson Problem
The R package TSP is introduced which provides a basic infrastructure for handling and solving the traveling salesperson problem and provides an interface to Concorde, one of the best exact TSP solvers currently available.
Convex hull or crossing avoidance? Solution heuristics in the traveling salesperson problem
The crossing avoidance hypothesis was examined from the perspectives of its capacity to explain existing data, its theoretical adequacy, and its ability to explain the results of three new experiments, which were more consistent with the convex hull than with the crossing avoidance hypotheses.
Human performance on the traveling salesman problem
Two experiments on performance on the traveling salesman problem (TSP) are reported, testing the hypothesis that complexity of TSPs is a function of number of nonboundary points, not total number of points.
Clustering, Randomness, and Regularity: Spatial Distributions and Human Performance on the Traveling Salesperson Problem and Minimum Spanning Tree Problem
It is suggested that these results provide support for the ideas that human solv- ers attend to salient clusters of nodes when solving these problems, and that a similar process (or series of processes) may underlie human performance on these two tasks.
A model of human performance on the traveling salesperson problem
A computational model is proposed of how humans solve the traveling salesperson problem (TSP) and may find better solutions than some conventional heuristic algorithms for solving TSPs, and comparative results are reported that support this suggestion.
Convex hull and tour crossings in the Euclidean traveling salesperson problem: Implications for human performance studies
It is argued that, in the literature so far, there is no evidence for the convex-hull hypothesis, and the hypothesis that people aim at avoiding crossings is proposed and motivated.
The traveling salesman problem: A hierarchical model
A new algorithm is presented, which is based on a hierarchical pyramid architecture, for solving the Euclidean traveling salesman problem (TSP), which is quite similar to the performance of the subjects.