Traveling Salesman Problem as a Markov Process and Distribution of Solutions: Case Study

In this study, an example of the Traveling Salesman Problem (TSP) was transformed into the Markov process, then solutions randomly generated by the process were examined. For the simulation, the distances between locations were transformed into conditional probabilities by two different methods and the probability transition matrices necessary for the Markov process definition were obtained. The optimum solution for the given TSP was produced and the probability distribution was evaluated. Moreover, the entropy of the processes was calculated, and the effect of entropy on the solution set distribution was interpreted.