traveling salesman problem是什么意思，traveling salesman problem的意思翻译、用法、同义词、例句

旅行商问题；货郎担问题

Branch-and-cut methods can solve many combinatorial optimization problems, especially large scale problems, for instance, traveling salesman problem(TSP).

分支-切割法可以用来解决许多组合最优化问题，特别是大规模问题，例如旅行商问题（TSP）。

By use of the properties of ergodicity, randomicity, and regularity of chaos, a chaos ant colony optimization (CACO) algorithm is proposed to solve traveling salesman problem.

利用混沌运动的遍历性、随机性和规律性等特点，提出了一种求解旅行商问题的混沌蚁群（CACO）算法。

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

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.

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

Based on analyzing the encoding characteristics of POCSAG carefully, the Problem can he abstracted as a special Traveling Salesman Problem, soa mathematical model of optimization encoding is set up.

经过对POCSAG码编码特性的分析，这一问题可以抽象为一个特殊的旅行商问题，从而得出优化编码的数学模型。

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.

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

Film Delivery Problem, a new problem of optimization grouping, is the extension of the Traveling Salesman Problem(TSP) on which has been done research for over ten years.

影片投递问题是近十几年来研究相当活跃的旅行商问题（TSP）的拓展，是组合优化的新问题。

MAX-MIN ant system algorithm is one of the best approaches to resolve the traveling salesman problem and the quadratic assignment problem.

MIN蚂蚁系统算法是解决旅行商问题及二次分配问题的最好方法之一。

In order to find the internal rules of self-adaptive behavior, this paper introduces parameter-control and sets pheromone's range, which are applied to the Traveling Salesman Problem(TSP).

为寻求算法自适应过程的内部规律，结合旅行商问题，采用参数控制、设置信息素范围的方法进行探讨。

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.

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

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

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

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

The detailed realization of the method was illustrated and some examples of the traveling salesman problem were computed. Simulation results prove that the new algorithm is effective and feasible.

选取旅行商问题作为算法的仿真实例，通过对仿真实例进行计算和结果比较，验证了该算法的有效性和可行性。

Traveling salesman problem(TSP) is a NP complete combinatorial optimum problem.

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

TSP(Traveling Salesman Problem)is a typical NP-hard problem in combinatorial optimization and Genetic Algorithm is one of methods for solving TSP.

TSP问题是一个经典的NP难度的组合优化问题，遗传算法是求解TSP问题的有效方法之一。

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.

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

TSP (Traveling Salesman Problem) is a typical NP-complete problem, and the genetic algorithm (GA) is the method for solving NP-complete problem.

TSP问题是典型的NP完全问题，遗传算法是求解NP完全问题的一种方法。

TSP(Traveling Salesman Problem)is a typical NP-Complete problem, genetic algorithm(GA)is the perfect method for solving NP -Complete problem.

TSP问题是典型的NP完全问题，遗传算法是求解NP完全问题的一种理想方法。

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

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

An improved tabu search - crossover tabu search (CTS) was proposed, which is applied for solving a well-known combinatorial optimization problem-the traveling salesman problem (TSP).

提出一种改进的禁忌搜索（TS）-交叉禁忌搜索（CTS），并用于混合优化问题旅行商问题（TSP）的求解。

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的影响进行了分析。

The usage of the SOM for the protein folding problem is similar to that for the Traveling Salesman Problem.

使用该高级官员的蛋白质折叠问题是类似的旅行商问题。

This article discusses the computational complexity of Traveling Salesman Problem, and points out the difference of computational complexity between Decisive TSP and Optimal TSP.

讨论了货郎问题的计算复杂性，指出了货郎优化问题与货郎判定问题计算复杂性的差异。

Traveling Salesman Problem (TSP) is considered as an old and difficult problem in combinatorics.

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

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

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

An Immune Genetic Algorithm(IGA) is used to solve traveling salesman problem(TSP).

用一种免疫遗传算法（IGA）对TSP问题进行求解。

The evolutionary algorithm using inver-over operator for the traveling salesman problem(TSP) has great ascendancy, because its ability in global searching for optimal individual is powerful.

使用逆转算子求解TSP的演化算法具有很强全局搜索能力，在求解TSP问题中显示了巨大的优势。

In this paper, a personification algorithm for solving the Traveling Salesman Problem (TSP) is proposed, which is based on original greedy algorithm.

基于贪心算法提出了一种改进的求解旅行商问题（TSP）的拟人算法。