 |
|
|
|
|
 |
 |
|
Super TSP: A trip around the world
|
|
|
|
|
|
| Organization: | Iwate University |
| Department: | Department of Electrical and Electronic Engineering |
|
|
|
|
|
|
0207-380
|
|
|
|
|
|
1994-12-10
|
|
|
|
|
|
The package including; two dimensional TSP, three dimensional TSP and Super TSP (a trip around the world) programs. The Monte Carlo method was used for determining the optimal route. All of the codes was written in Mathematica using the functional programming style. The traveling salesman will visit all N cities once and end of the trip coincides with the beginning. But he wishes to save his money, so he must find out the optimum route.
|
|
|
|
|
|
|
|
|
|
|
|
TSP, monte carlo, simulation, traveling salesman problem, graphs
|
|
|
 |
|
|
| SuperTSP.nb (691 KB) - Mathematica notebook |
Files specific to Mathematica 2.2 version:
| | SuperTSP.ma (539.3 KB) - Mathematica notebook |
|
|
For the newest resources, visit Wolfram Repositories and Archives »
