The Travelling Salesman's Problem
This applet tests the simulated annealing algorithm to solve the travelling salesman's problem. The user finds a route visiting 16 nodes of a random network and the computer finds an optimized route. The distances of both routes are compared.
- Learning Exercises
- Bookmark Collection (1) Bookmark Collections
- Course ePortfolios
- Accessibility Info