英语释义

• a salesman who travels to call on customers

英汉例句

• The idea of Harold「s getting a job as a traveling salesman doesn」t appeal to his wife.

  哈罗德要找一份旅行推销员的想法不合他妻子的心意。

• Enlighted by the mutual contacts between the nature species groups, the paper proposes the inter-group competition and collaboration of genetic algorithms to solve the traveling salesman problem.

  受自然界物种群体间相互联系的启发，提出了群体间竞争与协作的遗传算法来解决旅行商问题。

• On this basis, we proposed a two-step solution of the traveling salesman problem, a large number of simulation experiments show that the algorithm has produced good results.

  在此基础上，我们又提出了解决旅行商问题的两步法，大量的仿真实验表明这一算法取得了良好的效果。

• The conception and method of online scheduling in parcel post automated warehouse are put forward, that is dynamic scheduling problem, which is equal to solve online traveling salesman problem.

  提出了邮包自动化仓库在线调度的概念和方法，即动态调度问题，实际上等同于解决在线旅行商问题。

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

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

• Ordered crossover operator is a kind of in common use genetic crossover operator to solve traveling salesman problem.

  在用遗传算法求解旅行商问题时，顺序交叉算子是一种较为常用的遗传交叉算子。

• Tool-path airtime optimization during multi-contour processing in leather cutting is regarded as generalized traveling salesman problem. A hybrid intelligence algorithm was proposed.

  将皮革裁剪多轮廓加工空行程路径优化问题归结为广义旅行商问题，提出了一种求解问题的混合智能优化算法。

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

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

• 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在静态组合最优化和动态组合优化问题中的应用。

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

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

• By use of the properties of ant colony algorithm and genetic algorithm, a hybrid algorithm is proposed to solve the traveling salesman problems.

  利用蚁群算法和遗传算法的属性，混合算法来解决旅行商问题。

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

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

• In this way, they effectively solved the 「traveling salesman problem,」 which involves finding the shortest route that allows a traveling salesman to call at all the locations he has to visit.

  这样，它们有效地解决了「旅行推销员问题」，即如果一个旅行推销员需访问多个地点，如何找到访问这些地点的最短路线。

• In solving the traveling salesman problems, artificial fish swarm algorithm takes a significant advantage in convergence speed and the high precision is also guaranteed.

  通过人工鱼群算法解决旅行商问题，证明人工鱼群算法在收敛时间上是占很大优势，收敛精度也得到保证。

• This chaotic neural network is used to the 10-city traveling salesman problem (TSP), and the influence of trigonometric function self-feedback on TSP is analyzed.

  混沌神经网络的10个城市的旅行商问题（TSP），和三角函数自反馈对TSP的影响进行了分析。

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

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

• The story revolves around Gregor Samsa, a traveling salesman who wakes up one morning to discover that he has turned into a large insect.

  故事围绕格雷戈尔·萨姆沙展开，他是一个旅行推销员，一天早晨起来发现自己变成了一只巨大的昆虫。

相似词

traveler旅行者；旅客；旅行推销员（等于traveller）