旅行商 的英文怎麼說

中文拼音 [lǚhángshāng]
旅行商 英文
commercial traveler traveling salesman roadman drummer
  • 旅 : Ⅰ名1 [軍事] （軍隊的編制單位） brigade 2 （泛指軍隊） troops; force 3 （姓氏） a surname Ⅱ動詞1 ...
  • 行 : 行Ⅰ名詞1 （行列） line; row 2 （排行） seniority among brothers and sisters:你行幾? 我行三。where...
  • 旅行 : travel; journey; tour
  1. Crossover tabu search for traveling salesman problem

    一種求解旅行商問題的交叉禁忌搜索
  2. Famous chinese tea and professional tea service are also available. qingyi, qingyuan, roma, paris. .,

    高檔微波爐電磁爐餐具酒具一應俱全，舉家度假蜜月旅行商旅會務
  3. The paper discusses the operational characteristics of warehouse and gives a common order picking optimal algorithm for travel salesman problem

    摘要分析了自動化倉庫堆垛機揀選作業的運行特點，給出了堆垛機揀選作業旅行商數學模型的常用優化演算法。
  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. An improved partheno - genetic algorithm for tsps

    一種改進的求解旅行商問題的單親遺傳演算法
  7. Directed black and white traveling salesman problem

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

    一種新的求解旅行商問題的混合遺傳演算法
  9. Fractals combined with case - base for traveling salesman problems

    分形法與範例庫推理相結合進化求解旅行商問題
  10. Traveling salesman problem

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

    最常見的例子是著名的「旅行商問題」 ，這個問題乍一看幾乎是平淡乏味的：
  12. Translate the following sentence into chinese, ‘ the city was the last stop for the caravans on the silk road before all those silks and spices went by water to europe

    這個城市是旅行商隊在絲綢之路上的最後一站，次后，這些絲綢和香料通過水運到歐洲。
  13. When conrad hilton was a child, his father ran a $ 1 - a - night rooming house for traveling salesmen who were passing through san antonio, texas

    康納德?希爾頓還是個孩子的時，他的父親經營著一家「一晚一美元」的旅店，接待經過得克薩斯州的聖安東尼奧的旅行商人。
  14. 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城市旅行商問題和中國旅行商問題。
  15. The paper based on the idea of k - opt algorithm for tsp, present a swap algorithm for the one - dimensional cutting - stock problem

    摘要根據旅行商問題（ tsp ）的鄰域搜索演算法的思想，提出了型材下料問題的一種優化演算法。
  16. In the paper, the situation and method of scheduling problem studied of automated warehouse are surveyed completely. the problems of automate guide vehicle transport and stack crane picking order are analyzed deeply in parcel post automated warehouse, basic mathematic model of scheduling is set up

    通過對郵包自動化倉庫系統中的自動導引小車運輸問題和巷道堆垛機的揀選順序認真地分析，建立起了調度的基本數學模型，提出了用總的空載時間作為目標函數，並且把這兩類問題都歸結為求解旅行商問題。
  17. 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

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

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

    利用經典的對稱旅行商問題求解過程來測試各種識別方法，再利用積木塊的識別結果改進原有遺傳演算法，包括改進積木塊的識別率以及基於積木塊的交叉、變異運算元。
  20. The travelling salesman problem is always one of the most interesting and the hardest topic in combinatorial majorization. there is currently a lot of ongoing activity in the scientific community to research tsp

    旅行商問題就是一類有代表性的已被證明具有npc計算復雜性的組合優化難題，是目前國內外研究的熱點和前沿問題。
分享友人
分享到 Line

分享到臉書