Main Article Content
Travelling Salesman Problem (TSP) is a form of a problem in optimizing the search for the shortest route by passing through every city in exactly one time. The problem of searching the shortest route of a location can be solved by using many other optimizing algorithms. In this research, genetics algorithm was used by using two crossover methods namely cycle crossover and partial-mapped crossover. The parameters used were crossover probability and mutation probability, the sum of the city, maximum generation, the sum of the population and also threshold. In this research two testing models were used. In the first one, in order to get the generation and the best fitness it used the 80% consistency stopping criteria, and in the second one, in order to get the best testing time, it used the 100 and 500 maximum generation stopping criteria. The result of the first test showed that PMX method is better than the CX one. This was shown through the 8 times of testing which the result was the best PMX generation was 104,0469 and the CX was 350,4563. The second test resulted that the best testing time of the PMX time was 1,1035 second and the CX method was 2,2374 second, thus, it can be concluded that the solution brought by the PMX method is considered better than the CX.
This work is licensed under a Creative Commons Attribution-NoDerivatives 4.0 International License.