The Traveling Salesman Problem (TSP): A Spatial Navigation Task for Rats.

The Traveling Salesman Problem (TSP) is a behavioral test used to measure the efficiency of spatial navigation. It is an optimization problem, in which a number of baited targets are placed in an arena, and as the subject travels between the targets, the route is recorded and compared to chance and optimal routes. The TSP is appealing for the study of learning, memory, and executive function in nonhuman animals because the memory requirements can easily be modified with minor adjustments to task parameters. In the standard version of the task, rats are initially pre-trained to forage for bait in the arena. Once the animals consistently retrieve the bait, they are tested with a set of novel target configurations, and their behavior is recorded. The videos are then scored to produce several measures of performance.
(Copyright © 2018 The Authors; exclusive licensee Bio-protocol LLC.)