The Travelling Monkey
Library Home || Full Table of Contents || Suggest a Link || Library Help
|Ivars Peterson (MathLand)|
|One of the classic problems of planning ahead concerns a traveling salesman who must visit customers in a number of cities scattered across the country and then return home. The problem is to find the shortest possible route visiting each city only once. It turns out that vervet monkeys can also solve the traveling salesman problem -- albeit to a limited extent. In the May 29 Nature, Audrey E. Cramer and C.R. Gallistel of the University of California at Los Angeles report that, rather than always heading for the nearest foodsupply, the monkeys apparently plan their next three visits to minimize distance and travel time.|
|Levels:||High School (9-12), College|
|Math Topics:||Algorithms, Graph Theory, Optimization, Animal Biology|
© 1994-2013 Drexel University. All rights reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.