He shared stories of his days as a traveling salesman.
他分享了自己还是旅行推销员时的故事。
Cook told Clara how he had become blind over time and shared stories of his days as a traveling salesman.
库克告诉克拉拉他是如何随着时间的推移而失明的，并分享了他作为旅行推销员的故事。
Bill's father was a traveling salesman.
比尔的父亲是一名旅行推销员。
Mary's husband is a traveling salesman and he's always on the wing.
玛丽的丈夫是个旅行推销员，他总在旅行。
John quit his job and struck out on his own as a traveling salesman.
约翰辞掉工作去做旅行推销员，独力闯新路。
Matt: it's partly that, but I've got fed up with being a traveling salesman.
麦特：钱是原因之一，同时我也厌倦了巡回推销的工作。
I would travel up and down the East Coast from city to city like a traveling salesman.
我像个旅行销售员，成天奔波于东岸各城市之间。
The problem of sequence planning can be translated into Traveling Salesman Problem (TSP).
序列规划问题一般转化为旅行商问题来求解。
Neural Network with Transient Chaos (TCNN) can be used to solve the Traveling Salesman Problem (TSP).
具有瞬态混沌特性的神经网络(TCNN)可以解tsp。
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）和非线性方程组都是具有广泛的应用背景的重要问题。
The solution on The Traveling Salesman Problem which is a famous problem in the combination optimal mathematics is very profound.
货郎担问题是组合优化中的著名问题，到目前为止它还没有一个有效算法。
Charles W. Post, a traveling salesman and sometime venture capitalist, was among the many philosophical heirs of Sylvester Graham.
查尔斯·波斯特是一个旅行推销员，曾经做过风险投资，他是西尔维斯特·格雷厄姆饮食哲学的众多继承人之一。
By choosing appropriate operators and parameters, genetic algorithms (GA) can solve the traveling salesman problem (TSP) effectively.
通过选择合适的算子和参数，遗传算法(GA)可以有效求解旅行商问题(tsp)。
The story revolves around Gregor Samsa, a traveling salesman who wakes up one morning to discover that he has turned into a large insect.
故事围绕格雷戈尔·萨姆沙展开，他是一个旅行推销员，一天早晨起来发现自己变成了一只巨大的昆虫。
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.
本题中周先生想到各地旅游，每个城市都被访问一次且仅一次，我们考虑到了旅行商问题的解决方法。
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.
采用随机三角点阵上城市间的最近邻关系，构造路径子空间来求解旅行推销员问题。
I've spent most of my career as a traveling salesman, and I know that there's nothing lonelier than a bunch of salesmen eating their meals in a motel coffee shop.
我工作的主要经历大部分时间是跑外当作外勤推销员，因此，我知道没有什么比一帮推销员在汽车旅馆的餐厅里吃饭时更感到孤独的事了。
I 've spent most of my career as a traveling salesman, and I know that there's nothing lonelier than a bunch of salesmen eating their meals in a motel coffee shop.
我工作经历的大部分时间是做跑外推销员，所以我知道，没有什么比一帮推销员在汽车旅店的餐厅里吃饭更感到寂寞的了。
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问题中巡回路径编码串的组合最优化问题。
In solving the traveling salesman problems, artificial fish swarm algorithm takes a significant advantage in convergence speed and the high precision is also guaranteed.
通过人工鱼群算法解决旅行商问题，证明人工鱼群算法在收敛时间上是占很大优势，收敛精度也得到保证。
In solving the traveling salesman problems, artificial fish swarm algorithm takes a significant advantage in convergence speed and the high precision is also guaranteed.
通过人工鱼群算法解决旅行商问题，证明人工鱼群算法在收敛时间上是占很大优势，收敛精度也得到保证。
应用推荐