Comparison of Parents Selection Methods of Genetic Algorithm for TSP

Abstract

One of Area of Artificial Intelligence is used to optimize combinatorial problem. Many combinatorial problems like Travelling Salesman, Network Graph problem are optimize by Artificial Intelligence (AI) Searching Methods. One of Searching method of AI is Genetic Algorithm. In Genetic Algorithm parent selection for next generation is very important because solution of problem depends on how much optimized solution derives. In this paper, we present comparative performance of roulette wheel, Elitism and tournament selection method for Travelling Salesman problem. And we found that elitism method is best in all these methods.