ANALISIS MAPPING PADA PARTIALLY MAPPED CROSSOVER DALAM ALGORITMA GENETIKA PADA TRAVELLING SALESMAN PROBLEM
Abstract: Traveling salesman
problem is the problem how salesman can set tour to visit a number of cities
which known distance of the city with other cities so that the distance is the
minimum distance where the salesman can only visit the city exactly once. To
resolve TSP problem, there are many optimization methods that can be used one
of them which is a genetic algorithm. Genetic algorithm is an algorithm which
have same search method as a mechanism of biological evolution. Crossover is a
genetic operator which the process of exchanging some genes on chromosome first
parent with the majority of genes in the two parent chromosomes to form a new
chromosome .One of the crossover method used in solving traveling salesman
problem is partially mapped crossover ( PMX ),where the process mapping of PMX
are determines the variation exchange of genes on chromosomes that affect the
achievement of best fitness on 2 chromosome. In this study the first variation
(PMX variation I) is designed using random point position while in the second
variation (PMX variation II) is designed by using the change in the mapping
area. Testing in this study using data from the Travelling Salesman Problem
Library (TSPLIB). The result obtained that PMX which designed by using randomly
cut position have best fittness better than PMX is designed by changing the
position of the mapping area and if it compared with the general form of PMX
with the same position cut point.
Penulis: Sri Melvani hardi,
Muhammad Zarlis, Erna Budiarti
Kode Jurnal: jptinformatikadd140216
