Traveling salesman problem This is a group work. Traveling salesman is a convergence study for the problem. It is coded in Java and its error rate is very low. In this application, the closest neighbor, 2-opt and SimulatedAnnealing algorithms are used together.