单词traveling-salesman-problem
网络: 旅行销售员问题；旅行推销人员问题
A simulation of course traveling salesman problem shows that the improved algorithm gets a same result, but a faster calculating speed.
应用于过程旅行商问题的仿真计算表明，该算法具有相同的计算结果和更快的求解速率。
Traveling salesman problem to a salesman to sell a number of city merchandise, known distance between each city (or travel).
某售货员要到若干城市去推销商品，已知各城市之间的路程（或旅费）。
The usage of the SOM for the protein folding problem is similar to that for the Traveling Salesman Problem.
使用该高级官员的蛋白质折叠问题是类似的旅行商问题。
Using ant colony algorithm to solve the traveling salesman problem(TSP) is a classic kind of dealing with optimized combinatorial problem.
用蚁群算法解决旅行商问题是组合优化处理中的一类经典问题。
Therefore, the new finding shows these cells can map their own route and easily solve a simple version of traveling salesman problem.
也就是说，这个新的发现告诉了我们，这些细胞可以不靠外力就自己设计行程，并且轻而易举的解决一个型态简易的「推销员旅行问题」。
This paper presents some approaches to the application of Genetic Algorithms to the Traveling Salesman Problem.
本文提出了一些对遗传算法应用于旅行商问题的方法。
A discrete particle swarm optimization algorithm is designed to tackle the Traveling Salesman Problem.
提出一种优化线性顺序问题的简便的离散粒子群算法。
Traveling Salesman Problem (TSP) is a classic combinatorial optimization problem and NP-hard.
旅行商问题是一个经典的组合优化问题，也是一个NP难问题。
TSP(Traveling Salesman Problem) is a typical combinational optimization problem.
TSP问题是一个典型的组合优化问题。
The optimization computing of some examples on traveling salesman problem is made to show that it is useful and simple.
将此算法应用在旅行商间题上，实验结果证明了该算法的有效性。