Multiple Travelling Salesmen Problem Solver

This code solves the Multiple Travelling Salesmen Problem using the intlinprog Mixed Integer Linear Programming Solver

This code was written along side my undergraduate dissertation to solver the MTSP using MILP methods. The solver is albe to take input coordinate files or randomly generate coordinates. It outputs a visulisation of the solution and an export file of the route coordinates.