Algoritma Genetika Untuk Menyelesaikan Travelling Sallesman Problem With Time Windows (tsp-tw) Pada Rekomendasi Rute Perjalanan Wisata Event Di Daerah Istimewa Yogyakarta
Parisaktiana Fathonah 28 Maret 2018 Teknik Informatika

Abstract / Intisari :
Event tour is a Travelling Sallesman Problem with Time Windows (TSP-TW). This research aims to design and apply genetic algorithm model to give recommendation of travel route or event visit in Yogyakarta Special Region by considering opening time and closing time. The proposed Genetic Algorithm can take both symmetrical and asymmetric distance. The recommendations are given not only consider the distance but also the travel time. The distance and travel time is obtained from Google Maps using the Google Maps API. Genetic algorithm encoding scheme using permutation encoding, parent selection using roulette-wheel selection method, crossover method used is cycle crossover, mutation method using swapmutation and can keep the best individual generated in certain generation not lost during evolution process. The test results showed the best number of individuals for objects <8 is 30 individuals in one population and for objects ? 8 are 50 individuals in one population. Criteria cease if after 57 successive generations the highest unchanged fitness value. Keywords— Genetic Algorithm, Event Jogja, Traveling Salesman Problem, Cycle Crossover.

File PDF :
   Parisaktiana Fathonah--stmikelrahma.pdf

Tag Jurnal :