Optimal Tour Planning - Jupyter Notebooks
In the following notebooks, we learn to solve the travelling salesman problem (TSP) using different algorithms.
This notebook gives an overview of solving the travelling salesman problem using the Miller-Tucker-Zemlin (MTZ) formulation. We will be back to using
The solution time for MTZ models of different problem sizes increase drastically. So, in this notebook, we learn to benchmark the performance of the MTZ model for varying problem sizes.
Using the nearest neighbour method learned in class, we learn to solve the travelling salesperson problem.
We solve the travelling salesperson problem using genetic algorithm (GA).
We compare different methods of solving the travelling salesperson problem.
In this notebook, we explore the travelling salesperson problem with multiple salespeople.
Running the notebooks
You can download a zip file containing all the notebooks that we covered in this session from the link below: