CAS Community   >   Resources   >  

Travelling Salesman classroom tool

Travelling Salesman classroom tool

John Lamb

Created by John Lamb
last edited Nov 06 2017 by John Lamb

This resource written in demonstrates 2 algorithms for the travelling salesman problem. This classic problem requires starting from a given point and visiting a number of towns before returning to the starting point in the shortest possible route. This challenge is that as the number of towns increase the number of possible routes grow in a factorial way. An example of this is 6 towns results in 6x5x4x3x2x1=720 possible routes. An increase to 12 produces 4,79,001,600. More efficient algorithms are used in practice due to the time needed to check all possible routes(a brute force approach). The tool allows the following,

  1. Brute force method algorithm
  2. Nearest neighbour algorithm
  3. Paste a map
Downloaded 555 times.


This resource has attached files: to access these files, please tick the box below to assent to the license terms
License: The resources on CAS website are under Creative Commons Attribution-Share Alike 3.0 licence unless otherwise specified by the resource creators.

You must confirm that you have read and agree the licence's ToS before you can download the attachments of this resource.

I have read the licence agreement of this resource and agree to abide by its terms and conditions.

Feedback and Comments

Available when logged in (join via the front page, for free):
  • View 4 comments on this resource.
  • View resource history, links to related resources.
  • Leave feedback for the author(s), or help by editing the resource.

All Rights Reserved © Computing At School 2021
Using the websiteDisclaimer of liabilityCookies policyPrivacy notice