This project contains MATLAB-code to solve the travelling salesman problem using two different approaches.
Solves the problem with a simple brute force algorithm. Requires a n x n - distance (or cost) matrix as input.
Solves the problem with a performance improved dynamic programming algorithm. Requires a n x n - distance (or cost) matrix as input.
Provides an interface for distance matrix creation via the Google Distance Matrix API. Requires an API-key.
Template for a performance test setup.