Java 2-opt solution for TSP Coursework from Edinburgh Napier University Algorithms and Data Structures class.
This is a simple single threaded 2-opt solution to the classic traveling salesman problem for a piece of coursework. The project first conducts a quick nearest neighbour initial solution.
The program is pretty basic with no user input for configuration, but please feel free to take and change this as you wish.