In a static environment, or dynamic environment can be a good solution for TSP problem

TSP (Traveling Salesman Problem) problem, also known traveling salesman problem, traveling salesman problem, is seen in the many applications of a combinatorial optimization problem. This problem can be simply described as: given a weighted graph G, requires a weighted graph G the right to find a cumulative minimum Ham ilton loop. If the TSP problem between the nodes involved in weight, the number of nodes varies over time, can be called dynamic TSP. Dynamic TSP problem can be widely used in  Abrasive grinding , routing, robot control, vehicle routing, mobile computing and other fields. Author based on dynamic characteristics and requirements of the TSP, the 2-OPT algorithm,3-OPT algorithm and genetic algorithm combine to design and implement a solution to the problem of dynamic TSP algorithm. Through the experiment, the algorithm is proved in a static environment, or  Abrasive grinding wheel  can be a good solution for the TSP problem, and high efficiency. Dynamic characteristics and requirements of the TSP TSP problem with dynamic TSP problems are closely linked, and has its own characteristics. Dynamic TSP problems often have the following characteristics and requirements: ① real time. Dynamic TSP problem is changing, costs between nodes, number of nodes varies over time.