You are here:

Use of a Colony of Cooperating Agents and MAPLE To Solve the Traveling Salesman Problem
PROCEEDINGS

Annual International Conference on Technology in Collegiate Mathematics,

Abstract

This paper reviews an approach for finding optimal solutions to the traveling salesman problem, a well-known problem in combinational optimization, and describes implementing the approach using the MAPLE computer algebra system. The method employed in this approach to the problem is similar to the way ant colonies manage to establish shortest route paths from their colonies to feeding sources and back. The method is compared to more traditional methods such as the Lin-Kernighan approach, or Neighborhood graph (proposed by Johnson and McGeoch) and other "evolutionary" methods such as simulated annealing and genetic algorithms. (Author/DDR)

Citation

Guerrieri, B. (1999). Use of a Colony of Cooperating Agents and MAPLE To Solve the Traveling Salesman Problem. Presented at Annual International Conference on Technology in Collegiate Mathematics 1999. Retrieved April 21, 2021 from .

This record was imported from ERIC on April 18, 2013. [Original Record]

ERIC is sponsored by the Institute of Education Sciences (IES) of the U.S. Department of Education.

Copyright for this record is held by the content creator. For more details see ERIC's copyright policy.

Keywords