Given a list of nodes you need to find the best way to visit every node only once and return to the starting point with the lowest possible cost

Contains symetric and asymetric tsp instances.

Contains a .py gui app and you can create tsp instances by using it.

An approach to solve tsp problems by using the vns metaheuristic method.

Solving tsp instances by using simple local search algorithms.