Use of Genetic Algorithms to solve the famous TSP
Switch branches/tags
Nothing to show
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Failed to load latest commit information.
bin Reorg Jul 8, 2015
dist Reorg Jul 8, 2015
images Reorg Jul 8, 2015
src Reorg Jul 8, 2015
.classpath Reorg Jul 8, 2015
.gitignore Gitignore Jul 8, 2015
.project Reorg Jul 8, 2015
LICENSE add license Apr 30, 2016 Reorg Jul 8, 2015
algogenetique.jpg Reorg Jul 8, 2015

Travel Salesman Problem solved by Genetic Algorithm

This program solves, or rather finds a good solution for the TSP (Travelling Salesman Problem).

Once you've domwloaded and installed Oracle Sun JRE, run the jar file.

Choose the number of cities : (ex : 30) Choose the number of ways : (ex : 120, the more you have ways the luckier you should be) Choose the number of iterations (i.e : generations) : (ex : 1000, a big number is necessary) Choose the number of mutations : choose between 2 or 3 and you'll get good results)

You can also either save the generated cities in a file or re-use the previous saved cities.

Then launch the program !