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 ******** 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）的拟人算法。