TSPSG is intended to generate and solve "travelling salesman problem" (TSP) tasks. It uses the 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. 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 the Branch and Bound method to solve a particular task.
|Tags||TSP Math Mathematics Algorithms Testing Travelling Salesman Problem Branch and Bound Method|
|Operating Systems||Unix Mac OS X Windows Mobile Symbian OS Windows CE Linux Windows BlackBerry 10|
|Implementation||C++ Qt 4 Qt Qt 5|
|Translations||English Ukrainian Russian|
TSP Solver and Generator has recently passed the QA and is now published at the Nokia OVI Store. Read more: http://tspsg.info/en/news/some-symbian-love
Release Notes: This beta mainly features bugfixes: seven bugs have been fixed. Some new features were added too. One of them is the support for embedding a solution graph into HTML when saving a solution (using data URI scheme). Another feature is the ability to set up page-related options for printing (i.e., paper size, orientation, and margins).
Release Notes: The main new feature of this release is the solution graph generation. Also, it features toolbar customization (only on desktop platforms), drag-an-drop, support for switching between available Qt styles, an improved solution output generation algorithm, and some other improvements and bugfixes.
Release Notes: This version features symmetric mode, an improved solution algorithm, support for tasks with up to 50 cities, printing of solution results, and many more.