Acknowledging crossing-avoidance heuristic violations when solving the Euclidean travelling salesperson problem
- 84 Downloads
If a salesperson aims to visit a number of cities only once before returning home, which route should they take to minimise the total distance/cost? This combinatorial optimization problem is called the travelling salesperson problem (TSP) and has a rapid growth in the number of possible solutions as the number of cities increases. Despite its complexity, when cities and routes are represented in 2D Euclidean space (ETSP), humans solve the problem with relative ease, by applying simple visual heuristics. One of the most important heuristics appears to be the avoidance of path crossings, which will always result in more optimal solutions than tours that contain crossings. 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. Results show that properties, such as the number of nodes making up the convex hull, the standard deviation of the angles between nodes, the average distance between all nodes in the graph, the total number of nodes in the graph, and the tour cost (i.e., a measure of performance), are significant predictors of whether crossings are likely to occur.
We would like to thank Dr. Rachel Blaser for her detailed and very constructive review. We would also like to thank Dr. Matthew Dry for his constructive review, for providing us instructions on how to make our statistical models more rigorous and useful, and for providing us with ideas on future directions for our work in the area of human performance in the travelling salesperson problem.
Compliance with ethical standards
This research did not receive any specific grant from funding agencies in the public, commercial, or not-for-profit sectors.
Conflict of interest
All authors declare that they have no conflict of interest.
All procedures performed in the study that involved human participants are in accordance with the ethical standards of the Higher Colleges of Technology research committee and were approved by the City Unity College (Athens, Greece) research committee, where this research initially began. Furthermore, the procedures comply with the 1964 Helsinki declaration and its later amendments.
Informed consent was obtained from all individual participants included in the study using online consent forms, which worked as a pre-requisite to participating in our web-based experiment.
- Anderson, J. R. (1993). Rules of the mind. Hillsdale, NJ: L. Erlbaum Associates.Google Scholar
- Bender, L. (1938). A visual-motor Gestalt test and its clinical use (Vol. 3)., American Orthopsychiatric Association Monograph Series NY: American Orthopsychiatric Association.Google Scholar
- Bisiacchi, P. S., Sgaramella, T. M., & Farinello, C. (1998). Planning strategies and control mechanisms: Evidence from closed head injury and aging. Brain and Cognition, 5, 339–361.Google Scholar
- Gandhi, R. (2001). Approximate solution for the Traveling Salesman’s Problem Using Continuous Hopfield Network. ECE 559: Traveling Salesman’s Problem’s Solution using Hopfield NN, pp. 1–9.Google Scholar
- Kuhn, M. (2016). Contributions from Wing J., Weston S., Williams A., Keefer C., Engelhardt A., Cooper T., Mayer Z., Kenkel B., The R Core Team, Benesty M., Lescarbeau R., Ziem A., & Scrucca L.: Classification and regression training. In R Package Version 6.0–70.Google Scholar
- Maroco, J., Silva, D., Rodrigues, A., Guerreiro, M., Santana, I., & de Mendonça, A. (2011). Data mining methods in the prediction of Dementia: A real-data comparison of the accuracy, sensitivity and specificity of linear discriminant analysis, logistic regression, neural networks, support vector machines, classification trees and random forests. BMC Research Notes, 4(1), 299.CrossRefPubMedPubMedCentralGoogle Scholar
- Matai, R., Mittal, M. L., & Singh, S. (2010). Traveling salesman problem: An overview of applications, formulations, and solution approaches. INTECH Open Access Publisher.Google Scholar
- Newell, A., & Simon, H. A. (1972). Human problem solving. Englewood Cliffs, NJ: Prentice-Hall.Google Scholar
- Nilsson, C. (2003). Heuristics for the traveling salesman problem (pp. 1–6). Linkoping: Linkoping University.Google Scholar
- Pizlo, Z., Stefanov, E., Saalweachter, J., Li, Z., Haxhimusa, Y., & Kropatsch, W. G. (2006). Traveling salesman problem: A foveating pyramid model. The Journal of Problem Solving, 1(1), 8.Google Scholar
- Polivanova, N. I. (1974). On some functional and structural features of the visual-intuitive components of a problem-solving process. Voprosy Psychologii [Questions in Psychology], 4, 41–51.Google Scholar
- R Core Team (2016). R: A language and environment for statistical computing. R Foundation for Statistical Computing, Vienna, Austria. https://www.R-project.org/.
- Schrijver, L. (2003). Combinatorial optimization-polyhedra and efficiency. Algorithms and Combinatorics, 24, 1–1881.Google Scholar
- Wang, R., Xiang, J., Zhou, H., Qin, Y., & Zhong, N. (2009). Simulating human heuristic problem solving: A study by combining ACT-R and fMRI brain image. In International Conference on Brain Informatics (pp. 53–62). Springer, Berlin.Google Scholar