NotesFAQContact Us
Search Tips
Peer reviewed Peer reviewed
Direct linkDirect link
ERIC Number: EJ1055685
Record Type: Journal
Publication Date: 2006
Pages: 19
Abstractor: As Provided
ISSN: EISSN-1932-6246
Traveling Salesman Problem: A Foveating Pyramid Model
Pizlo, Zygmunt; Stefanov, Emil; Saalweachter, John; Li, Zheng; Haxhimusa, Yll; Kropatsch, Walter G.
Journal of Problem Solving, v1 n1 Article 8 p83-101 Fall 2006
We tested human performance on the Euclidean Traveling Salesman Problem using problems with 6-50 cities. Results confirmed our earlier findings that: (a) the time of solving a problem is proportional to the number of cities, and (b) the solution error grows very slowly with the number of cities. We formulated a new version of a pyramid model. The new model has an adaptive spatial structure, and it simulates visual acuity and visual attention. Specifically, the model solves the E-TSP problem sequentially by moving attention from city to city, the same way human subjects do. The model includes a parameter representing the magnitude of local search. This parameter allows modeling individual differences among the subjects. The computational complexity of the current implementation of the model is O(n[superscript 2] ), but this can most likely be improved to O[nlog(n)]. Simulation experiments demonstrated psychological plausibility of the new model.
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:
Publication Type: Journal Articles; Reports - Research
Education Level: N/A
Audience: N/A
Language: English
Sponsor: N/A
Authoring Institution: N/A
Grant or Contract Numbers: N/A