TSPSG is intended to generate and solve Travelling Salesman Problem tasks. It uses Branch and Bound method for solving. An input is a number of cities and a matrix of city-to-city travel prices. The matrix can be populated with random values in a given range (useful for generating tasks). The result is an optimal route, its price, step-by-step matrices of solving and solving graph. The task can be saved and opened later. The result can be saved as HTML or ODF.
Download:
TSP Solver and Generator, Beta v0.14.170
TSP Solver and Generator, Beta v0.14.170
No comments:
Post a Comment