go top 返回词典
• Traveling salesman problem(TSP) is a NP complete combinatorial optimum problem.

旅行问题NP完全组合优化问题。

youdao

• The problem of sequence planning can be translated into Traveling Salesman Problem (TSP).

序列规划问题一般转化旅行问题来求解

youdao

• Traveling Salesman problem (TSP) is a classic combinatorial optimization problem and NP-hard.

旅行问题经典组合优化问题，也是一个NP难问题。

youdao

• Neural Network with Transient Chaos (TCNN) can be used to solve the Traveling Salesman Problem (TSP).

具有瞬态混沌特性的神经网络(TCNN)可以tsp

youdao

• It has been paid much attention to since the successful application in the famous traveling salesman problem.

自从旅行商等著名问题得到富有成效应用之后，已引起人们越来越关注重视

youdao

• This paper presents some approaches to the application of Genetic Algorithms to the Traveling Salesman Problem.

本文提出了一些遗传算法应用于旅行问题方法

youdao

• Traveling Salesman Problem(TSP) is a classic combined optimization problem and it is proved that TSP is NP hard.

TSP旅行问题作为经典组合优化问题，已经证明个NP难题。

youdao

• We present an algorithm about Traveling Salesman problem through the method of Self saturated Subscript in Cycle.

通过圈上结点下标自足方法给出了一个关于旅行推销员问题算法

youdao

• Traveling salesman problem(TSP) and nonlinear equations are two kinds of important problems with widely applications.

旅行问题TSP非线性方程组都是具有广泛应用背景重要问题

youdao

• Experimental results on Traveling Salesman Problem (TSP) demonstrate that the proposed algorithm is viable and efficient.

旅行问题(TSP)作为算例，实验结果验证新算法的有效性和高效性。

youdao

• The solution on The Traveling Salesman Problem which is a famous problem in the combination optimal mathematics is very profound.

货郎担问题组合优化中的著名问题，到目前为止没有一个有效算法。

youdao

• By choosing appropriate operators and parameters, genetic algorithms (GA) can solve the traveling salesman problem (TSP) effectively.

通过选择合适算子参数遗传算法(GA)可以有效求解旅行问题(tsp)。

youdao

• Experimental results on traveling salesman problem show that proposed algorithm has a good global searching ability and high convergence speed.

基于旅行问题实验证明算法具有好的全局搜索能力收敛速度。

youdao

• The Film Deliverer Problem(FDP), a new problem in the combination optimization is much more complicated than the Traveling Salesman Problem(TSP).

影片递送问题简称FDP组合优化一个问题，它旅行问题（简称TSP复杂

youdao

• By using LCA to solve traveling salesman problem, satisfactory results are obtained. Examples show that LCA has good global search characteristic.

列队竞争算法旅行问题获得了满意结果显示出列队竞争算法良好全局搜索性能

youdao

• The Film Deliverer problem (FDP), a new problem in the combination optimization is much more complicated than the Traveling Salesman problem (TSP).

影片递送问题(简称FDP)组合优化一个问题，它旅行问题(简称TSP)复杂

youdao

• 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.

本题周先生想到各地旅游每个城市访问一次，我们考虑到了旅行商问题解决方法

youdao

• The applications of ACO to static and dynamic COPs, such as traveling salesman problem, quadratic assignment problem, network routing problem are reviewed.

结合旅行问题指派问题以及网络路由问题典型组合优化问题，概述了ACO静态组合最优化动态组合优化问题中的应用

youdao

• Abstract: Traveling salesman problem is an extensive study of the academic community, many scholars have long painstaking research, with impressive results.

摘要旅行问题一个学术界广泛研究问题，长期以来许多学者潜心研究有了可观的成果。

youdao

• 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.

采用随机三角点阵城市近邻关系，构造路径子空间求解旅行推销员问题。

youdao

• 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问题巡回路径编码串的组合最优化问题。

youdao

• 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).

巡检机器人走最短路径巡检所有检测点回到初始位置应该一个典型货郎担问题

youdao

• 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.

旅行推销员问题最受人喜爱的数学难题如果一个推销员不得不访问几个城市怎样最短路线使一次到达几个城市。

youdao

• 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.

旅行推销员问题最受人喜爱的数学难题如果一个推销员不得不访问几个城市怎样最短路线使一次到达几个城市。

youdao

\$firstVoiceSent
- 来自原声例句