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.

1. Fozia Hanif Khan, Nasiruddin Khan, Syed Inyatullah and Shaikh Tajuddin Nizam. Solving TSP problem TSP solving TSP problem by using genetic algorithm. Pages[79-88]. International Journal of Basic & Applied Sciences IJBAS Vol: 9 No: 10.
2. S.N. Sivananadam, S.N. Deepa, Introduction to Genetic Algorithm, Springer- Verlag Berlin Heidelberg 2008.
3. G. Kendall and G. Whitwell. An evolutionary approach for the tuning of a chess evaluation function using population dynamics. In Proceedings of the 2001 Congress on Evolutionary Computation, pages 995–1002. IEEE Press, World Trade Center, Seoul, Korea, 2001
4. Shah, S.M.; Thaker, C. S.; Singh, D.; Multimedia based fitness function optimization through evolutionary game learning, Emerging Trends in Networks and Computer Communications (ETNCC), 2011 International Conference on Publication Year: 2011, page(s): 164- 168.
5. Goldberg, D.E.: Genetic Algorithm in Search, Optimization and Machine Learning, Addison Wesley pub. Co. (1989)
6. http://www2.stetson.edu/mathcs/people/students/research/pdf/2010/dwells/final.pdf

Combinatorial problem TSP Genetic algorithm Elitism Roulette wheel selection Tournament selection