ERIC Number: ED460003
Record Type: Non-Journal
Publication Date: 1999-Nov
Reference Count: N/A
Use of a Colony of Cooperating Agents and MAPLE To Solve the Traveling Salesman Problem.
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)
Descriptors: Calculus, College Curriculum, Computer Software, Computer Uses in Education, Higher Education, Mathematics Education, Problem Solving, Teaching Methods, World Wide Web
For full text: http://archives.math.utk.edu/ICTCM/EP-13/C39/pdf/paper.pdf.
Publication Type: Reports - Descriptive; Speeches/Meeting Papers
Education Level: N/A
Authoring Institution: N/A