On the recovery of the traveling salesman problem from disruptions and a circle permutation algorithm

This paper discusses traveling salesman problem and in particular the recovery from disruptions. Based on the mathematical description of given traveling salesman problem the paper analyzes kinds of disruptions. Adding or deleting nodes can be represented as changes of cost of edges, so the paper only discusses the case when the edges are disrupted. Then the mathematical model of a post-disruption traveling salesman problem is given, and the circle permutation algorithm for solving the model is got from the permutation group in modern algebra.