People Efficiently Explore the Solution Space of the Computationally Intractable Traveling Salesman Problem to Find Near-Optimal Tours

Open Access

Peer-reviewed

Research Article

Daniel E. Acuña ,

* E-mail: acuna@cs.umn.edu

Affiliation Department of Computer Science and Engineering and Center for Cognitive Sciences, University of Minnesota, Minneapolis, Minnesota, United States of America
⨯
Víctor Parada

Affiliation Departamento de Ingeniería Informática, Universidad de Santiago, Santiago, Chile
⨯

Reader Comments (0)

Cities
Is the Subject Area "Cities" applicable to this article?

Thanks for your feedback.
Human performance
Is the Subject Area "Human performance" applicable to this article?

Thanks for your feedback.
Optimization
Is the Subject Area "Optimization" applicable to this article?

Thanks for your feedback.
Games
Is the Subject Area "Games" applicable to this article?

Thanks for your feedback.
Human learning
Is the Subject Area "Human learning" applicable to this article?

Thanks for your feedback.
Cognitive science
Is the Subject Area "Cognitive science" applicable to this article?

Thanks for your feedback.
Simulated annealing
Is the Subject Area "Simulated annealing" applicable to this article?

Thanks for your feedback.
Visual acuity
Is the Subject Area "Visual acuity" applicable to this article?

Thanks for your feedback.