Optimization-Based Distance Reachable Matrix Self-driving Tours Route Research

Since the reform and open policy, the national economy rapid development and at the same time Self-driving tours also developed quietly. Self-driving tours has made itself in the national economy more and more important role, self-driving tours has become popular form of the tourism.In the self-driving tours research, self-driving tours route research has made more and more attention to the self-driving tours research, traditional self-driving tours route optimization just consider the shortest path and the lowest cost problem, but now self-driving tours route optimization is no longer simple consider the shortest path and minimum cost but fully consider the possible route to the existing problem and loop of the loop self-driving tours route optimization.This paper will use graph theory to research self-driving tours route, And introduces the basic concept of the graph, use the graph of the vertex and edge weights to replace the real attractions and route of the self-driving’tours. And use the application of the adjacency matrix to store the graph. Then starting from the shortest path algorithm in the application of the graph theory research, After several path algorithm for comparison, based on the distance reachable matrix method to found the potential loop in the self-driving tours route.And put forward the distance reachable matrix algorithm can be applied flexibly, and used examples to prove that the flexible application of the distance reachable matrix algorithm, and puts forward the path failure method and the method of the vertex failure to solve self-driving tours route which exist loop in the route.