traveling salesman problem 中文意思是什麼

traveling salesman problem 解釋
回售貨員問題
  • traveling : adj. 旅行的，游歷的；流動的，移動的。n. 旅行，游歷；流動（劇團）；移動；滑走。 traveling expenses 旅費，盤費。
  • salesman : n. （pl. -men ）1. 售貨員，店員。2. 〈美國〉推銷員，跑街。n. -ship 售貨術；推銷術。
  • problem : n. 1. 問題，課題；疑難問題；令人困惑的情況。2. 【數、物】習題；作圖題。3. （象棋的）布局問題。adj. 1. 成問題的；難處理的。2. 關于社會問題的。
  1. Crossover tabu search for traveling salesman problem

    一種求解旅行商問題的交叉禁忌搜索
  2. By this algorithm, the optimal solution can been obtained in transportation problem n assignment problem, traveling salesman problenu flow shop sequencing problems hamilton problem. in addition, numerical examples have been given to demonstrate the actual applicant procedure

    並且通過對排序問題、貨郎擔貨問題、指派問題、 hamilton問題等線形規劃問題典型算例的求解，表明新的分配原則在一定程度上簡化了原有的分配過程，具有更強的通用性。
  3. This paper develops an ant colony optimization approach to the orienteering problem, a general version of the well - known traveling salesman problem with many relevant applications in industry

    摘要本研究發展一蟻群最佳化演演算法求解越野賽跑問題，此問題可被視為一廣義之? ?推銷員問題，其應用?圍極為廣泛。
  4. Concretely we discuss the application of the shortest path problem, traveling salesman problerm and project management method on the touring itinerary improvement of travel agency. furthermore, we explore the use of minimum spanning tree problem, overlaid problerm and maximum flow problerm on the touring itinerary improvement of scenic spots. and also enclosed detailed spreadsheet solutions

    具體的，討論了最短路問題、旅行商問題和排程問題在旅行社線路優化中的應用；討論了最小支撐樹問題、覆蓋問題和最大流問題在旅遊景區線路優化中的運用，並在附錄中給出了詳細的電子表格解法。
  5. An algorithms with taboo search in traveling salesman problem

    一種求解旅行商問題的禁忌搜索演算法
  6. Directed black and white traveling salesman problem

    有向黑白旅行商問題
  7. A new hybrid genetic algorithm for traveling salesman problem

    一種新的求解旅行商問題的混合遺傳演算法
  8. Traveling salesman problem

    旅行商問題
  9. The most common example is the notorious " traveling salesman problem, " which, at first sight, appears almost innocuous

    最常見的例子是著名的「旅行商問題」 ，這個問題乍一看幾乎是平淡乏味的：
  10. 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城市旅行商問題和中國旅行商問題。
  11. 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

    提出了郵包自動化倉庫在線調度的概念和方法，即動態調度問題，實際上等同於解決在線旅行商問題。
  12. 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

    摘要通過分析概念設計方案求解問題與旅行商問題的相似性，將方案求解問題轉化為組合優化的最優路徑問題，建立了基於動態規劃的解空間模型和基於最長路徑的優化模型。
  13. 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

    利用經典的對稱旅行商問題求解過程來測試各種識別方法，再利用積木塊的識別結果改進原有遺傳演算法，包括改進積木塊的識別率以及基於積木塊的交叉、變異運算元。
  14. As one of the latter algorithms, ant colony algorithm has been used to many fields, such as : traveling salesman problem, quadratic assignment problem, network routing and load - balancing problem, vlsi design, etc

    摘要蟻群演算法作為一種較新的進化類方法，目前已經在若干領域取得了成功的應用，諸如：旅行商問題、二次分配問題、通訊網路中的路由問題以及負載平衡問題、大規模集成電路設計等。
  15. 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問題的最優解。
  16. 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

    本文從模糊自適應遺傳演算法在解決組合優化問題中的應用出發，針對旅行商問題提出了兩種新的模糊自適應遺傳演算法?自學習混合模糊自適應遺傳演算法和神經模糊自適應遺傳演算法。
  17. The definition, the essential, the orietation model and eleven kinds of functions of mes was dissertated in the article, the relation between mes and the plan layer and the control layer was deeply analysised, and the characteristic of mes in the industry application was researched in detail. after analysised the current production condition and the existent problem in jigang plate plant, the design of system frame, dadabase and function module have been studied, and the realization of it has been expounded. for solving the low efficiency in arranging the rolling plan by man, based on the traveling salesman problem and the pack problem about 0, 1, the mathematics model of the schedule of rolling plan was put forward, and the most near insert way was introduced to solve it, the result was satisfied. based on the practical demands of jigang plate plant combined the academic research of mes software, it has been realized the valid combination between the management of production scene and the upper management software in the dissertation

    本文論述了mes的定義及其實質、 mes的定位模型和其十一項功能，深入分析它與計劃層和控制層的關系，並闡述了mes在行業應用中的特點。在分析濟鋼中厚板廠生產現狀及其存在的問題后，研究了系統的體系結構設計、數據庫設計和功能模塊設計，並對其實現進行了闡述。為了解決人工經驗編排軋製作業計劃問題的低效性，提出了基於旅行商問題和0 1背包問題的軋製作業計劃排序數學模型，並採用最近插入法進行求解，取得了滿意的效果。
  18. 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

    計算表明，在保證求得最優解的前提下，該平臺能很好地提高分支定界演算法的效率。
  19. This paper mainly focuses on the air sequencing problem in terminal area. by means of the single - machine scheduling method, the practical problem is reformulated into the cumulative traveling salesman problem with ready times ( ctsr - rt )

    本文主要針對終端區空中交通流量管理中的飛機排序問題，運用單機排序方法，將其轉化為一帶準備時間的累積旅行商問題（ ctsp ? rt ） 。
  20. We have found that many application of linear programming, such as assignment problem., traveling salesman problem, flow shop sequencing problem, hamilton problem and so on, fall into the category of transportation problem, that is, of shipping at minimum total cost a homogeneous good from a set of m warehouses to a set of n markets

    元素判別值分配法是基於運輸問題引發出的通用解法，通過遍歷調運表中的各行各列計算出每個元素的分配優先權重? ?元素判別值，然後依據元素判別值，根據調配原則進行元素分配，使得分配方案在多數情況下一次分配即可獲得最優解，但目前仍需要完善。
分享友人
分享到 Line

分享到臉書