Penanganan Fuzzy Time Window pada Travelling Salesman Problem (TSP) dengan Penerapan Algoritma Genetika
Abstract
The route of the travel tour packages offered by travel agents is not considered optimum, so the level of satisfaction the tourist is not maximal. Selection of the route of the travel packages included in the traveling salesman problem (TSP). The problem that occurs is uncertain tourists visiting destinations at the best destinations timing hereinafter be referred to as the fuzzy time window problem. Therefore, the authors apply the genetic algorithm to solve the problem. Based on test results obtained optimum solution with the fitness value of 1.3291, a population size of 100, the number of generations of 1000, a combination of CR=0,4 and MR=0.6.
Moraref