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
You Might Also Like
Designed for document-heavy industries, Pdftools’ suite of SDKs and APIs are here to make your document workflows easier, faster, and stress-free. Built on SDKs and APIs, the Pdftools products integrate seamlessly into your existing (or new) systems and applications. Process thousands of documents every minute. Our tools are precision-engineered to be efficient and run at blazing speeds. We’re engineers at heart, so we’re only satisfied with the most reliable, orderly, and usable, and well-documented platforms. Shrink file sizes down, but keep the quality and interactivity. Your documents will always be compliant for long-term archiving. We’ve obsessed over every detail in our products, and documented everything so it’s easy to get started.
Rate This Project
Login To Rate This Project
User Reviews
Be the first to post a review of TSP Solver and Generator!