Solving Traveling Salesman problem (TSP) is an important problem in Genetic Algorithm's Application, it is an optimization problem of the TSP path encoding in essence.
求解tsp问题是遗传算法应用的一个重要领域，其本质是TSP问题中巡回路径编码串的组合最优化问题。
Then Traveling Salesman Problem is described and its mathematics model is provided. Some correlative algorithms are introduced and their capability of solving TSP is compared.
随后叙述了TSP的一般提法，描述了其数学模型，综合介绍了关于解决TSP的相关算法，并做了性能比较。
As an essential question of the intelligent distribution system, route optimization has many problem-solving models, the most typical one is Traveling Salesman problem (short for TSP).
路径优化是物流配送中智能调度系统的核心问题，其中最典型的问题模型就是旅行商问题即TSP问题。
应用推荐