|
The Travelling Salesman's Problem

Library Home ||
Full Table of Contents ||
Suggest a Link ||
Library Help

| http://www-m9.ma.tum.de/dm/java-applets/tsp-usa-spiel/tsp.html | |
|
|
|
| Manu Konchady | |
| A trucking or delivery company is focused on optimum delivery cost. This can be achieved by using a system which determines the best highway route for each load. An optimum highway route can be displayed on a map. A route with 16 nodes is used to test the simulated annealing algorithm for solving the problem. Click on nodes to establish a route and compare it with the computer's route. | |
|
|
|
| Levels: | Middle School (6-8), High School (9-12), College |
| Languages: | English |
| Resource Types: | Problems/Puzzles, Web Interactive/Java |
| Math Topics: | Algorithms, Graph Theory, Optimization |
[Privacy Policy] [Terms of Use]


© 1994-2012 Drexel University. All rights reserved.
http://mathforum.org/
The Math Forum is a research and educational enterprise of the Goodwin College of Professional Studies.