TSP Solver and Generator

Generate and solve Travelling Salesman Problems


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.

This project was originally born as an Open Source rewrite of my University coursework Branch and bound method of solving Travelling Salesman Problem.


Subscribe to RSS - FreeBSD