traveling salesman problem tsp 中文意思是什麼

traveling salesman problem tsp 解釋
旅行推銷員問題
  • traveling : adj. 旅行的，游歷的；流動的，移動的。n. 旅行，游歷；流動（劇團）；移動；滑走。 traveling expenses 旅費，盤費。
  • salesman : n. （pl. -men ）1. 售貨員，店員。2. 〈美國〉推銷員，跑街。n. -ship 售貨術；推銷術。
  • problem : n. 1. 問題，課題；疑難問題；令人困惑的情況。2. 【數、物】習題；作圖題。3. （象棋的）布局問題。adj. 1. 成問題的；難處理的。2. 關于社會問題的。
  • tsp : 大氣總懸浮微粒年日平均值
  1. Traveling salesman problem is combinatorial optimization problem in graph theory, it has npc computation complexity, and lots of problem can transfer to traveling salesman problem. the computation of tsp is analyzed, then the hopfield network method for solving tsp is given, at last we solve 10 - citys traveling salesman problem and chinese traveling salesman problem by using chaos neural network modeling

    首先分析了旅行商問題在窮舉搜索法下的工作量；其次給出了求解旅行商問題的hopfield神經網路方法，同時分析了利用人工神經網路求解旅行商問題所存在的問題；最後利用混飩神經網路模型求解10城市旅行商問題和中國旅行商問題。
  2. Analyzed the similarity between scheme solving problem and traveling salesman problem ( tsp ), the scheme solving problem for conceptual design is transformed into an optimal path problem in combinatorial optimization, where the dynamic programming based solution space model and the longest path based optimization model are developed

    摘要通過分析概念設計方案求解問題與旅行商問題的相似性，將方案求解問題轉化為組合優化的最優路徑問題，建立了基於動態規劃的解空間模型和基於最長路徑的優化模型。
  3. The typical symmetric tsp ( traveling salesman problem ) solving process was used to test various recognition methods, and then the test results were used to improve the traditional ga, including improving the recognition rate of building blocks and mutation and crossover operators based on building block

    利用經典的對稱旅行商問題求解過程來測試各種識別方法，再利用積木塊的識別結果改進原有遺傳演算法，包括改進積木塊的識別率以及基於積木塊的交叉、變異運算元。
  4. The algorithm is based on the breadth - first search and optimized by ant algorithm. ants system is an artificial system based on the behavior of real ant colonies, which is often used to solve combinatorial problems, such as traveling salesman problem ( tsp ). in ant colony system ( acs ), a set of cooperating agents called ants cooperate to find good solutions to tsp

    本演算法基於寬度優先並用螞蟻演算法優化，螞蟻演算法是一種基於真實蟻群的人工智慧系統，常用於解決組合優化問題，如旅行商問題（ tsp ） ，在螞蟻演算法中一組螞蟻團結合作，尋找tsp問題的最優解。
  5. This paper is oriented toward applying fuzzy adaptive genetic algorithms ( faga ) to solve the traveling salesman problem ( tsp ). two new fagas, a self - learning mixed faga and a neuro faga, is studied in the paper

    本文從模糊自適應遺傳演算法在解決組合優化問題中的應用出發，針對旅行商問題提出了兩種新的模糊自適應遺傳演算法?自學習混合模糊自適應遺傳演算法和神經模糊自適應遺傳演算法。
  6. The solving tsp ( traveling salesman problem ) examples as benchmark shows that this platform can increase the branch and bound algorithm ' s efficiency and get the optimal solution sooner

    計算表明，在保證求得最優解的前提下，該平臺能很好地提高分支定界演算法的效率。
分享友人
分享到 Line

分享到臉書