Material Detail

The Travelling Salesman's Problem

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.


More about this material


Log in to participate in the discussions or sign up if you are not already a MERLOT member.