Only a few of the dynamic TSP problem or research objectives for TSP

TSP (Traveling Salesman Problem, abbreviated TSP problem) is a combination of mathematics in an old and difficult problem. Dynamic multi-objective TSP problem is proposed in recent years in the TSP problem developed on the new issues, it has both the characteristics of dynamic optimization problems, problems in the constantly  Polycrystalline diamond ; another characteristic of multi-objective optimization problem is often not  grinding wheel  with multiple compare the merits of the solutions exist, to form a solution space. At present, only some of the dynamic TSP problem or multi-objective TSP problem studied, while the dynamic multi-objective TSP problem of nearly blank stage, has yet to see any concrete solution and experimental results of the paper. So study the dynamic multi-objective TSP problem  Synthetic diamond  solution has great significance. Given the conceptual gap, this paper combined with dynamic multi-objective TSP TSP problem and the problem of the concept, the dynamic multi-objective TSP problem concept. In LKH algorithm, based on the first complete propose a method for dynamic multi-objective TSP problem feasible algorithm, but also in the concept of the problem, the algorithm feasibility algorithm performance and other aspects have made some analysis.