Optimization of Traveling Salesman Problem on Scheduling Tour Packages using Genetic Algorithms

Ciayumajakuning or often referred to as Cirebon, Indramayu, Majalengka and Kuningan, is located on the east side of West Java. In supporting the regional economy, the West Java government program, especially the community, is focused on the tourism sector. the short time of tourists and the number of tourist destinations that want to be visited, make tourists have to schedule their tour as effectively as possible. By using the Traveling Salesman Problem optimization can minimize the distance of tourist visits by considering the availability of time. The solution to this problem is by combining Traveling Salesman Problems and Genetic Algorithms that can represent candidates for scheduling solutions into chromosomes randomly, then evaluate using the fitness function and then do the selection. The selection method used in this study is the roulette wheel selection method, then crossovers and mutations. In each generation, chromosomes are evaluated based on the value of the fitness function. After several generations the genetic algorithm will produce the best chromosome, which is the optimal solution. this study Code A = Starting Point B = Buddhist Dayak Tribe Segandu Earth, Indramayu Code C = Mangrove Forest Sustainable Beach Karangsong Code D = Heritage Museum Kasepuhan Palace Cirebon Code E = Keraton Kacirebonan Kode F = Goa Sunyaragi Cirebon Code G = Starting Point. The Total Distance to be Passed is 17,706 Km