Skip to Main Content
The Travelling Salesman Problem (TSP) is one of the top problems, which has been addressed extensively by mathematicians and computer scientists. In this paper, we propose two algorithms namely `A' and `B' based on `Wandering Salesman' as an approach trying to find the shortest path from initial steps without taking any restrictions into account. The two proposed algorithms are based on genetic algorithm idea employing the mutation and elitism procedures. Subsequently, we show the performance of the two proposed algorithms in finding the shortest path by depicting the effective parameters. The results indicate that the algorithm `B' which is based on just 0's and 1's probabilities has outstanding performance comparing to the algorithm `A'.