Electronic Proceedings of the Thirteenth Annual International Conference on Technology in Collegiate Mathematics

Atlanta, Georgia, November 16-19, 2000

Paper C039

Use of a Colony of Cooperating Agents and Maple to Solve the Traveling Salesman Problem

Bruno Guerrieri

Department of Mathematics
Florida A&M University
412 Jackson-Davis
Tallahassee, FL 32307
Phone: (850) 599-3595
Fax: (850) 599-8480

list of all papers by this author

Click to access this paper: paper.pdf


A new approach to finding optimal solutions to the Traveling Salesman Problem is being reviewed and implemented using MAPLE. The method draws from the way ant colonies manage to establish shortest route paths from their colonies to feeding sources and back. We will compare this method to more traditional methods such as the Lin-Kernighan approach and to other 'evolutionary' methods such as simulated annealing and genetic algorithms.

Keyword(s): discrete mathematics, optimization