1. Home
  2. Material Detail: The Travelling Salesman's Problem

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.
Disciplines:
Go to Material 
Bookmark / Add to Course ePortfolio
Create a Learning Exercise
Add Accessibility Information
Rate
Add a Comment

Quality

More about this material

Material Type:
Simulation
Date Added to MERLOT:
March 16, 1998
Date Modified in MERLOT:
August 29, 2017
Author:
Submitter:
Barbra Bied Sperling
Hispanic Serving Institution
Primary Audience:
College General Ed
Mobile Compatibility:
Not specified at this time
Language:
English
Cost Involved:
No
Source Code Available:
Yes
Accessibility Information Available:
Unknown
Creative Commons:
Unknown

Browse...

Disciplines with similar materials as The Travelling Salesman's Problem
People who viewed this also viewed
Other materials like The Travelling Salesman's Problem

Comments

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