Solving Travelling Salesman Problem (TSP) using Java with algorithm methods of roulette and tournament.
First we need to include the guava-28.2-jre to make the program working.
In the console of the program which is responsible for executing java code we have to give the full name of traveling .txt file of which we wount to calculate the best fitness, number of generations, population size, chance for a breeding and also chance for a mutating. Some example numbers are given within the code for a problem of berlin52.