Traveling salesman problem(TSP) is a NP complete combinatorial optimum problem.
旅行商问题是NP完全的组合优化问题。
The problem of sequence planning can be translated into Traveling Salesman Problem (TSP).
序列规划问题一般转化为旅行商问题来求解。
Traveling Salesman problem (TSP) is a classic combinatorial optimization problem and NP-hard.
旅行商问题是一个经典的组合优化问题，也是一个NP难问题。
Neural Network with Transient Chaos (TCNN) can be used to solve the Traveling Salesman Problem (TSP).
具有瞬态混沌特性的神经网络(TCNN)可以解tsp。
It has been paid much attention to since the successful application in the famous traveling salesman problem.
自从在旅行商等著名问题中得到富有成效的应用之后，已引起人们越来越多的关注和重视。
This paper presents some approaches to the application of Genetic Algorithms to the Traveling Salesman Problem.
本文提出了一些对遗传算法应用于旅行商问题的方法。
Traveling Salesman Problem(TSP) is a classic combined optimization problem and it is proved that TSP is NP hard.
TSP（旅行商）问题作为经典的组合优化问题，已经被证明是一个NP难题。
We present an algorithm about Traveling Salesman problem through the method of Self saturated Subscript in Cycle.
通过圈上结点下标自足方法，给出了一个关于旅行推销员问题的算法。
Traveling salesman problem(TSP) and nonlinear equations are two kinds of important problems with widely applications.
旅行商问题（TSP）和非线性方程组都是具有广泛的应用背景的重要问题。
Experimental results on Traveling Salesman Problem (TSP) demonstrate that the proposed algorithm is viable and efficient.
以旅行商问题(TSP)作为算例，实验结果验证了新算法的有效性和高效性。
The solution on The Traveling Salesman Problem which is a famous problem in the combination optimal mathematics is very profound.
货郎担问题是组合优化中的著名问题，到目前为止它还没有一个有效算法。
By choosing appropriate operators and parameters, genetic algorithms (GA) can solve the traveling salesman problem (TSP) effectively.
通过选择合适的算子和参数，遗传算法(GA)可以有效求解旅行商问题(tsp)。
Experimental results on traveling salesman problem show that proposed algorithm has a good global searching ability and high convergence speed.
基于旅行商问题的实验证明，算法具有较好的全局搜索能力和收敛速度。
The Film Deliverer Problem(FDP), a new problem in the combination optimization is much more complicated than the Traveling Salesman Problem(TSP).
影片递送问题（简称FDP）是组合优化的一个新问题，它比旅行商问题（简称TSP）复杂得多。
By using LCA to solve traveling salesman problem, satisfactory results are obtained. Examples show that LCA has good global search characteristic.
用列队竞争算法解旅行商问题获得了满意的结果，显示出列队竞争算法良好的全局搜索性能。
The Film Deliverer problem (FDP), a new problem in the combination optimization is much more complicated than the Traveling Salesman problem (TSP).
影片递送问题(简称FDP)是组合优化的一个新问题，它比旅行商问题(简称TSP)复杂得多。
The problem in Chow expect travel around, every city is accessed once and only once, we take into account the solution to the traveling salesman problem.
本题中周先生想到各地旅游，每个城市都被访问一次且仅一次，我们考虑到了旅行商问题的解决方法。
The applications of ACO to static and dynamic COPs, such as traveling salesman problem, quadratic assignment problem, network routing problem are reviewed.
结合旅行商问题、二次指派问题以及网络路由问题等典型组合优化问题，概述了ACO在静态组合最优化和动态组合优化问题中的应用。
Abstract: Traveling salesman problem is an extensive study of the academic community, many scholars have long painstaking research, with impressive results.
摘要：旅行商问题是一个学术界广泛研究的问题，长期以来许多的学者潜心研究，有了可观的成果。
The nearest neighbour relation between cities on random triangle lattice has been used to construct a tour subspace and to solve the traveling salesman problem.
采用随机三角点阵上城市间的最近邻关系，构造路径子空间来求解旅行推销员问题。
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问题中巡回路径编码串的组合最优化问题。
The polling robot has to go past all the checking points and return to initial location along the shortest route. As you know, this is Traveling Salesman Problem (TSP).
让巡检机器人走最短路径巡检所有检测点并回到初始位置，这应该是一个典型的货郎担问题。
The traveling salesman problem is a favorite math conundrum: if a salesman has to visit a bunch of cities, how do you get him to all of them once via the shortest possible route.
旅行推销员问题是一个最受人喜爱的数学难题：如果一个推销员不得不访问几个城市，怎样走最短的路线使他一次到达这几个城市。
The traveling salesman problem is a favorite math conundrum: if a salesman has to visit a bunch of cities, how do you get him to all of them once via the shortest possible route.
旅行推销员问题是一个最受人喜爱的数学难题：如果一个推销员不得不访问几个城市，怎样走最短的路线使他一次到达这几个城市。
应用推荐