OPTIMISASI MASALAH TRAVELLING SALESMAN DENGAN ALGORITMA GENETIKA MENGGUNAKAN OPERATOR CYCLE CROSSOVER YANG DIMODIFIKASI

Abstract

This paper discusses genetic algorithm with modified cycle operator to solve tra- veling salesman problem. Genetic algorithm is a method that uses the principle of natural selection which is used to determine solutions to optimization problems. This method does not necessarily provide an optimal solution, but it can provide a good approximation to the optimal solution. One of the optimization problems that can be solved is the traveling salesman problem in which the application of this method is carried out by selecting parameters and crossover operators. In this paper, the modified cycle and cycle operators are used. The computational test pro- cess of the method discussed uses benchmark problems from the TSPLIB available at http://compt.ifi.uni-heidelberg.de/software/TSPLIB95/. The computational re- sults show that the modified cycle operator has advantages over the cycle operator.