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

Chicago, Illinois, October 30-November 2, 2003

Paper S007

This is an electronic reprint, reproduced by permission of Pearson Education Inc. Originally appeared in the Proceedings of the Sixteenth Annual International Conference on Technology in Collegiate Mathematics, Edited by Corinna Mansfield, ISBN 0-321-30456-x, Copyright (C) 2005 by Addison-Wesley Publishing Company, Inc.


Maple-based Algorithms for the Traveling Salesman Problem (Continuation)

Bruno Guerrieri


Florida A&M University


list of all papers by this author

Click to access this paper: paper.pdf

ABSTRACT

Introduction to the different methods of solution (nearest-neighbor, elastic net, branch and bound, simulated annealing, Lin-Kernighan, genetic algorithms, swarm intelligence, and neural network) of the Traveling Salesman Problem. We will provide the common Maple library needed and the supporting notes/worksheets so as to deliver a 'turn-key' product.

Keyword(s): Maple, applications, discrete mathematics