TSP Solver and Generator is intended to generate and solve Travelling Salesman Problem tasks. It uses Branch and Bound method for solving. Its input is a number of cities and a matrix of city-to-city travel costs. The matrix can be populated with random values in a given range (which is useful for generating tasks). The result is an optimal route, its price, step-by-step matrices of solving and a solving graph. The task can be saved in an internal binary format and opened later.
My contribution:
I am the author of this project. The project is currently “on hold” due to the lack of my spare time. But it will be revived, eventually.
We use cookies on this site to enhance your user experience
Some cookies on this site are essential, and the site won’t work as expected without them. These cookies are set when you submit a form, login or interact with the site by doing something that goes beyond clicking on simple links. We also use some non-essential cookies to anonymously track visitors or enhance your experience of the site.