Dynamic multi-objective TSP from mobile computing, mobile communications and other applications proposed a new class of

In the scientific management and economic decision-making in many application areas, there are lots of real-world dynamic multi-objective optimization problem. For the traveling salesman problem (Traveling Salesman Problem, TSP), in practice often taking multiple targets, such as the shortest distance, shortest and most economical cost,  synthetic diamond , and many other factors. Often exist between conflicting objectives. How to find multiple targets in a fair and reasonable solution is a more complex problem. In addition, in real life, a large number of multi-objective optimization problem with real-time, the question of the state change over time. These optimization problems in addition to the nature of multiple targets, but also dynamic. Dynamic  Diamond blade  TSP from mobile computing, mobile  abrasive grinding other applications proposed a new class of Np-hard mathematical model, it belongs to one of the latest evolutionary computation field of study. Dynamic multi-objective TSP and TSP is a dynamic combination of multi-objective TSP, as space communications (ground-, air-and space-based communication between each other) a mathematical model in 2004 for the first time put forward. With the classic TSP, static multi-objective TSP, dynamic single objective TSP compared to more complex dynamic multi-objective TSP, with greater challenge.