Wolfram Library Archive

All Collections Articles Books Conference Proceedings
Courseware Demos MathSource Technical Notes
Title Downloads

Traveling Salesman Problem

Terry Robb
Organization: RMIT University
Department: Department of Mathematics
Old MathSource #

Revision date


The traveling salesman problem is a classic example of combinatorial minimization. It involves finding the shortest itinerary for a traveling salesman who must visit each of N cities in turn. One technique for solving this problem is the method of simulated annealing, and this notebook uses InterCall to access an external subroutine that implements the annealing algorithm. An example in which an additional constraint, such as adding a penalty for a river crossing, is also given.

*Mathematics > Discrete Mathematics > Graph Theory

high school courseware, college courseware, graduate courseware, data analysis, tutorial, chemical engineering, civil engineering, communications engineering, electrical engineering, industrial engineering, graphics examples, interfacing, life sciences, biology, pure mathematics, applied mathematics, InterCall, intercall, MathLink, annealing
Downloads Download Wolfram CDF Player

Traveling.txt (11.9 KB) - Plain-text version of notebook
Traveling.nb (76 KB) - Mathematica notebook

Files specific to Mathematica 2.2 version:
Traveling.ma (30.3 KB) - Mathematica notebook

Translate this page: