Pengaruh Modifikasi Cara Bertanding Seleksi Turnamen Algoritma Genetika dalam Traveling Salesman Problem (TSP)

Traveling Salesman Problem (TSP) is a matter of determining the order of several cities that must be passed by salesmen. One algorithm in solving TSP is Genetic Algorithm, which has 3 (three) main operators, namely selection, crossover, and mutation. In genetic algorithms, cities are represented as genes, while trips are represented as individuals. Selection is one of the main operators in genetic algorithms and one of the selection operator techniques is tournament selection. Tournament selection compares a number of individuals through “tournament” to choose the best individual based on fitness value, so that individuals will be selected to continue to the next generation. Modification were made in the way of competing individuals to determine the effect of tournament selection on genetic algorithms in TSP. In this study modifications were made to the way of individual tournament, namely first modification tournament selection and second modification tournament selection. The purpose of this study was to determine the effect of tournament modification on tournament selection on TSP. The results of this study are the secondmodification tournament selection gets average best fitness higher than the first modification tournament selection, so using the second modification tournament selection gets a shorter total distance compared to the first modification tournament selection.