DownloadTSPSG is intended to generate and solve Travelling Salesman Problem (TSP) 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 in internal binary format and opened later. The result can be printed or saved as PDF, HTML, or ODF.
TSPSG may be useful for teachers to generate test tasks or just for regular users to solve TSPs. Also, it may be used as an example of using Branch and Bound method to solve a particular task.
Features
- Solving of Travelling Salesman Problem tasks with up to 50 cities
- Generation of the solution graph
- Creation of random Travelling Salesman Problem tasks
- Printing and saving solution results to PDF, HTML and ODF
- Multilinguality
Project Samples
License
GNU General Public License version 2.0 (GPLv2), GNU General Public License version 3.0 (GPLv3)Follow TSP Solver and Generator
Other Useful Business Software
Jamf Pro includes a host of features that helps to simplify device deployment, analyze inventory data, and respond to security threats easily. Whether you have a handful of iPads or tens of thousands of Mac, iPhone, iPad and Apple TV devices, Jamf has an intuitive solution for every organization of every size to meet every level of technology need.
Rate This Project
Login To Rate This Project
User Reviews
Be the first to post a review of TSP Solver and Generator!