After determining a iff each city once the shortest route

TSP is given n cities and distances between cities, each city asked to identify a pass if and only if one of the shortest route. It is a typical combinatorial optimization problem, and its consideration of the optimal solution is exponential. polycrystalline diamond  TSP problem is a NP-hard problem. Based on intelligent optimization algorithm for TSP, is  Diamond blade  hot topic in recent years. However, in the scientific management and economic decision-making in many application areas, there are lots of real-world multi-objective optimization problem. For the traveling salesman problem, in practice often taking multiple targets, such as the shortest distance, shortest and most economical cost,  Abrasive grinding , 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. This paper focuses on multi-objective genetic algorithm for solving TSP problems were studied.