2D and 3D Traveling Salesman Problem

Autor/inn/en	Haxhimusa, Yll; Carpenter, Edward; Catrambone, Joseph; Foldes, David; Stefanov, Emil; Arns, Laura; Pizlo, Zygmunt
Titel	2D and 3D Traveling Salesman Problem
Quelle	In: Journal of Problem Solving, 3 (2011) 2, S.167-193, Artikel 8 (27 Seiten) PDF als Volltext Verfügbarkeit
Sprache	englisch
Dokumenttyp	gedruckt; online; Zeitschriftenaufsatz
ISSN	1932-6246
DOI	10.7771/1932-6246.1096
Schlagwörter	Problem Solving; Mathematical Applications; Graphs; Visual Aids; Performance; Mathematics; Computer Simulation + Suchen Sie Ihr Suchwort? Problemlösen; Angewandte Mathematik; Innermathematische Anwendung; Grafische Darstellung; Anschauungsmaterial; Achievement; Leistung; Mathematik; Computergrafik; Computersimulation
Abstract	When a two-dimensional (2D) traveling salesman problem (TSP) is presented on a computer screen, human subjects can produce near-optimal tours in linear time. In this study we tested human performance on a real and virtual floor, as well as in a three-dimensional (3D) virtual space. Human performance on the real floor is as good as that on a computer screen. Performance on a virtual floor is very similar, while that in a 3D space is slightly but systematically worse. We modeled these results by a graph pyramid algorithm. The same algorithm can account for the results with 2D and 3D problems, which suggests that deterioration of performance in the 3D space can be attributed to geometrical relations between hierarchical clustering in a 3D space and coarse-to-fine production of a tour. (As Provided).
Anmerkungen	Purdue University Press. Stewart Center Room 370, 504 West State Street, West Lafayette, IN 47907. Tel: 800-247-6553; Fax: 419-281-6883; e-mail: pupress@purdue,edu; Web site: http://docs.lib.purdue.edu/jps/
Erfasst von	ERIC (Education Resources Information Center), Washington, DC
Update	2020/1/01