英汉例句

• the solution on the traveling salesman problem which is a famous problem in the combination optimal mathematics is very profound.

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

• to solve the multiple traveling salesman problem (m-tsp), a novel dna-ga is proposed in this paper.

  针对m-tsp问题，本文提出了一种利用dna遗传算法求解该问题的新思路。

• the contrasting experiments on the typical traveling salesman problem (tsp) show that the proposed algorithm is better than standard ant colony system in speed and accuracy.

  针对典型的旅行商问题（tsp）进行对比实验，验证了所提出的算法在速度和精度方面优于传统的蚁群系统。

• in addition, we prove the performance ratio of the convex hull insertion for the traveling salesman problem in euclidean plane has the upper bound about a logarithmic function of the number of nodes.

  另外，我们证明了凸包选边插入法的性能比有一个关于点数的对数函数上界。

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

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

• traveling salesman problem (tsp) is a typical np-complete problem, which can be solved by the genetic algorithm popularly.

  tsp问题是典型的np完全问题，遗传算法是求解np完全问题的一种常用方法。

• the chinese traveling salesman problem is one of combinatorial optimization problems, and is a np .

  中国旅行商问题是一个组合优化问题，是一个np 问题。

• the problem of sequence planning can be translated into traveling salesman problem (tsp).

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

• traveling salesman problem (tsp) is considered as an old and difficult problem in combinatorics.

  tsp属于组合数学中一个古老而又困难的问题。

• by choosing appropriate operators and parameters, genetic algorithms (ga) can solve the traveling salesman problem (tsp) effectively.

  通过选择合适的算子和参数，遗传算法（ga）可以有效求解旅行商问题（tsp）。

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

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

• 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问题。

• second, we apply all of them to 10-city travelling salesman problem (tsp), respectively.

  其次将四种方法分别应用于10个城市的旅行推销商问题。