Paper Title
Statistical Comparison of Artificial Intelligence Techniques for Traveling Salesman Problem

There are many artificial intelligence techniques developed for solving optimization problems. Simulated Annealing and Genetic Algorithms are artificial intelligence methods and are still being developed. In this study, the Genetic Algorithms and Simulated Annealing methods are applied to the Traveling Salesman Problem which is a NP-hard optimization problem. The data was obtained from a regional distributor. For both methods, the objective function is determined to be the shortest total path. Significance of the results obtained by Simulated Annealing and Genetic Algorithms methods have been investigated statistically. Index Terms - Artificial Intelligence, Genetic Algorithms, Simulated Annealing, Traveling Salesman Problem