A Study of Genetic and Heuristic Algorithm for Traveling Salesman Problem

Abstract

Genetic algorithm is an algorithm that behaves in a way similar to the evolution process of the mankind, i.e. the crossing of the chromosomes. Heuristic algorithm is another algorithm of Artificial Intelligence that improves the speed of solving a problem. They are very common Algorithms in Artificial Intelligence that are used for various complex problems. Traveling Salesman Problem is NP- Hard problem in combinatorial optimization that finds its applications in manufacture of microchips, planning, logistics etc. In this paper we study the Genetic Algorithm and Heuristic algorithm for Traveling Salesman Problem individually, with their respective drawbacks. In the next part of the paper we compare both the algorithms with respect to the traveling salesman Problem. Finally we study the combination algorithm of Genetic algorithm and Heuristic algorithm, again for the Traveling Salesman Problem and give its advantages over both the algorithms.