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.
旅行推销员问题是一个最受人喜爱的数学难题：如果一个推销员不得不访问几个城市，怎样走最短的路线使他一次到达这几个城市。
So the problem here, roughly, is given, a number of cities, and say the cost of traveling from city to city by airplane, what's the least cost round trip that you can find?
基本上就是一个这样的问题，你被告知了一些城市，以及在城市之间坐飞机旅行的花费，那一条是你们能找到最短往返路径？
Most of the research in Computer Science these days is devoted to time efficiency, particularly the theoretical time barrier of NP-Complete problems (like the Traveling Salesman problem).
不过现如今的许多计算机科学研究更加关注时间效率，特别是NP完全问题中的理论时间边界(比如旅行商人问题，这是完全NP中一个重要的问题，译者注)。
The researchers first had to develop the question, dubbed the Traveling Umpire Problem.
研究者首先提出问题，称其为巡回裁判员问题。
The suggestion of division of temperature zones to solve the heating problem is given so as to both provide the comfortable traveling environment and save the energy.
对如何解决好供暖问题提出了划分温度区的建议，从而达到既提供舒适的旅行环境，又节省能源的目的。
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 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.
提出了邮包自动化仓库在线调度的概念和方法，即动态调度问题，实际上等同于解决在线旅行商问题。
We present an algorithm about Traveling Salesman problem through the method of Self saturated Subscript in Cycle.
通过圈上结点下标自足方法，给出了一个关于旅行推销员问题的算法。
Sucked into the Pacific on that horrifying day two years ago, traveling through the Pacific, volunteers like HWF had been fighting the already big problem of marine debris.
在两年前那恐怖的一天被吸进太平洋，穿越太平洋，志愿者们一直处理着这个海洋垃圾大问题。
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问题。
This problem deals with finding a minimal path through a grid of points while traveling only from left to right.
该问题是要在一组点的格网中找到一条从左至右的最小路径。
By choosing appropriate operators and parameters, genetic algorithms (GA) can solve the traveling salesman problem (TSP) effectively.
通过选择合适的算子和参数，遗传算法(GA)可以有效求解旅行商问题(tsp)。
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.
受自然界物种群体间相互联系的启发，提出了群体间竞争与协作的遗传算法来解决旅行商问题。
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.
采用随机三角点阵上城市间的最近邻关系，构造路径子空间来求解旅行推销员问题。
Traveling salesman problem(TSP) and nonlinear equations are two kinds of important problems with widely applications.
旅行商问题（TSP）和非线性方程组都是具有广泛的应用背景的重要问题。
Then Traveling Salesman Problem is described and its mathematics model is provided. Some correlative algorithms are introduced and their capability of solving TSP is compared.
随后叙述了TSP的一般提法，描述了其数学模型，综合介绍了关于解决TSP的相关算法，并做了性能比较。
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问题中巡回路径编码串的组合最优化问题。
To solve a kind of multiple traveling salesman problem(MTSP)for minimizing the completion time, a hierarchical genetic algorithm(HGA)and decoding method with matrix are proposed.
为了解决最小化旅行时间的多旅行商一类问题，提出了一种递阶遗传算法和矩阵解码方法。
The Film Deliverer Problem(FDP), a new problem in the combination optimization is much more complicated than the Traveling Salesman Problem(TSP).
影片递送问题（简称FDP）是组合优化的一个新问题，它比旅行商问题（简称TSP）复杂得多。
Bad breath is a common problem for many people, given the wide variety of substances traveling through our mouths daily.
想到每天有种类繁多的食物从我们的嘴里穿越而过，口臭成为困扰许多人的毛病就不足为奇。
At present the popular high-risk dangerous traveling project more and more receives tourists favor, extremely is also serious along with it fresh each kind of traveling security problem.
目前兴起的高危险性旅游项目越来越受到旅游者的青睐，随之而生的各种旅游安全问题也极其严重。
The problem of sequence planning can be translated into Traveling Salesman Problem (TSP).
序列规划问题一般转化为旅行商问题来求解。
The problem of sequence planning can be translated into Traveling Salesman Problem (TSP).
序列规划问题一般转化为旅行商问题来求解。
应用推荐