Week 6 - Freight Distribution

In this session we learn about optimal tour planning for two problems of freight distribution: The Travelling Salesman Problem (also referred to as the Travelling Salesperson Problem) and Vehicle Routing Problem. We learn about different methods to solve the problem, such as the nearest neighbour algorithm, the sweep method, and the savings method.

We are building upon our earlier work on mathematical programming and supply chain networks.

Part 1 & 2 - Optimal Tour Planning and The Travelling Salesman Problem

Part 2, 3, 4 & 5 - Nearest Neighbour Algorithm, Vehicle Routing, The Sweep Method

Part 6 - The Savings Method

• ⬇️ Download slides ⬇️

Lecture materials

• Notebooks

  Jupyter Notebooks that contain interactive demonstrations of the algorithms that were covered in this week’s lecture.

• Tutorial 6

  Tutorial questions relating to the materials covered in this week’s lectures.