Genetic algorithms and travelling salesman problem

ABSTRACT Masters Thesis GENETIC ALGORITHM AND TRAVELLING SALESMAN PROBLEM Mustafa KAYA Fırat University Graduate School of Natural and Applied Sciences Department of Computer Engineering 1999, Page 85 In this research Genetic Algorithm and Genetic Programming are taken up. The operators and their preparing for algorithm are discussed. The difficulties of Genetic Programming and the technics to pass over are studied. The definition and formulas of Travelling Salesman Problem are handled. TSP have been solved many times with Genetic Algorithms, but, the quality of these solutions have still been discussed. The shortest route, with cties of Turkey, found by genetic programming. The results are given comperative. Many researchers defence and study that, if you use other subsidiary technics and better coding data, you can get better solutions. Some heuristics were given, and their advantages and disadvantages on solutions of TSP are discussed. The results, program code and output of program are given by interpretation. KEYWORDS: Genetic Algorithm,Traveller Salesman Problem, Genetic Programming, Route Problem.