TSP Flaming – Quickly finds a solution of the Travelling Salesman Problem
Given a map with cities locations, what is the least-cost round-trip route that visits each city exactly once and then returns to the starting city?
Size of solution space is n!, where n is number of cities. The most direct solution rapidly becomes impractical.
Instead of using exhaustive enumeration a generic probabilistic meta-algorithm is used. In fixed amount of time it finds a good approximation to the global optimum in a large search space.
Install TSP Flaming in Ubuntu
Download .deb package from here .Install this .deb package by double clicking on it or run the following command from your terminal
sudo dpkg -i tspflaming_1.2-0~ppa1_i386.deb