Travelling Salesman Problem Solved using Genetic Algorithm Combined Data Perturbation
J Kanimozhi, R. Subramanian · Zenodo (CERN European Organization for Nuclear Research) · 2018
Traveling Salesman Problem (TSP) is a challenging problem in combinatorial optimization. The important of this problem is due to the fact that it is used in many fields such as transportation, logistics, semiconductor industry, problem of routing etc. In this paper Travelling Salesman Problem (TSP) is solved using Genetic Algorithm (GA) combined with data perturbation (DP) and the algorithm named as Perturbed GA. DP is a technique used to avoid local optima and to increase the diversity property of the problem. Efficiency of the algorithm is calculated in terms of fitness, convergence and error rate and from the result analysis, it's proved that Perturbed GA outperforming GA to solve TSP.