The aim of a travelling salesperson problem is to visit every vertex of the network and return to the starting vertex using the route that has the minimum total weight. The problem requires students to find the best route for a courier to take to deliver parcels to a number of towns and return back to base.

Travelling salesperson problem: presentation - an introduction to the problem outlining the student task and putting the task into context.

Travelling salesperson problem: problem - a student version of the problem outlined in the introduction.

Travelling salesperson problem: solution - one possible suggested solution for the problem.

The OR Society have developed these problems for use in Decision mathematics lessons. The problems can be used as an introduction to a topic, part of the learning process or as a plenary exercise.

Show health and safety information

Please be aware that resources have been published on the website in the form that they were originally supplied. This means that procedures reflect general practice and standards applicable at the time resources were produced and cannot be assumed to be acceptable today. Website users are fully responsible for ensuring that any activity, including practical work, which they carry out is in accordance with current regulations related to health and safety and that an appropriate risk assessment has been carried out.


You might also like

Resource collection
Resource collection
Resource collection

Published by


Share this resource