This session expands upon the Travelling Salesman Problem (TSP) that we covered last week, focusing on the Vehicle Routing Problem (VRP). The VRP is a generalized version of TSP and incorporates decision aspects such as vehicle capacity and range in the decision-making process.
The VRP is one of the most fundamental decision problems in the field of freight distribution. A wide range of variations has been developed that incorporate practical routing considerations that arise in the logistics sector.
Today’s section will focus on VRP principles and their mathematical representation. We will also be discussing a few common VRP variations, such as Fleet Mix VRP, VRP with Time Windows, and the Green VRP (commonly used to study the impacts of electric vehicle adoptions in the logistics sector).
Lecture materials
Notebooks
Jupyter Notebooks that contain interactive demonstrations of the algorithms that were covered in this week’s lecture.
Tutorial 7
Tutorial questions relating to the materials covered in this week’s lectures.