最佳排序方法 的英文怎麼說

中文拼音 [zuìjiābèixùfāngfǎ]
最佳排序方法 英文
optimal sorting method
  • 最 : 副詞（表示某種屬性超過所有同類的人或事物） most; best; worst; first; very; least; above all; -est
  • 排 : 排構詞成分。
  • 方 : Ⅰ名詞1 （方形; 方體） square 2 [數學] （乘方） involution; power 3 （方向） direction 4 （方面） ...
  • 法 : Ⅰ名詞1 （由國家制定或認可的行為規則的總稱） law 2 （方法; 方式） way; method; mode; means 3 （標...
  • 最佳 : the best; optimum
  • 排序 : collate
  • 方法 : method; means; way; technique; process; procedure; plan; device; recipe; fashion; tool; maneuver
  1. Be ~ will be helpan to loow the means to - ve the schmes. aotwh to. ' proechon theom ", we proed the schein m is no dea efficien on the piddution forer, then ge the new dw wt is theforal efficien and scale efficien at the same time

    對傳統dea評價模型進行適當的改進，採用一種新的決策單元排序方法，引入「理想決策單元」 、 「效率評價指數」等概念，優選出綜合效益最佳方案，為科學決策提供參考依據。
  2. Considering the np - complete problem, how to get the approximate optimized scheme of job - shop scheduling, and aimed at improving the efficiency of products and taking good advantage of concurrence, asynchronism, distributing and juxtaposition in multi - products and devices processing, we could divide the working procedures into the attached one which has the only precursor and subsequence and unattached one by analyzing working flow chart of job - shop, that is the working procedures are divided into two types, then the bf and the ff methods about memory scheduling in os are applied, therefore a new approximate optimized scheme is presented in the paper which could solve the common job - shop scheduling. namely, the acpm and the bfsm are applied to the classified and grouped working procedures considering the compact of the procedures and practical examples approved it. the results we analyzing and tested show that it is better than the heuristic algorithm common used, for less restriction terms, more satisfying algorithm complexity and better optimized results

    針對job - shop調度問題求最優解演算法這一npc問題，本文以充分發揮多產品、多設備加工所具有並發性、異步性、分佈性和并行性的加工優勢，從而提高產品的加工效率為目標，對job - shop調度問題的工藝圖進行適當分解，使工序在一定時間段或是為具有唯一緊前、緊后相關工序或是為獨立工序，即將工序分兩類，再結合操作系統中內存調度的最佳適應（ bf ）調度方法和首次適應（ ff ）調度方法的先進思想，通過分析提出了一種解決一般job - shop調度問題的全新近優解方案：在考慮關鍵設備上工序盡量緊湊的前提下，將工序分類、對這兩類工序分批採用擬關鍵路徑法（ acpm ）和最佳適應調度方法（ bfsm ）安排工序的演算法，用實例加以驗證，並給出結果甘特圖。
  3. Agv ( automated guided vehicle ) optimization is a typical np problem, in the course of initial group generation, this article applied accumulator process, crossover operator based continuous insertion heuristic mode, and push - connect - exclude method. according to stacker running process and characteristics, stacker optimization was devided into two parts, the first one was shelves number optimization, the second one was travel scheduling problem. finally, this article written genetic algorithm program based on c

    Agv的優化調度屬于典型的np問題，在初始群體的產生中，採用聚加過程，並建立了可行插入的條件；提出了基於連續插入啟發式的交叉運算元；採用了推?銜接?排除過程來使任務的滿意度達到最佳；針對堆垛機的運行過程，建立了數學模型，並依據其運行特點，把堆垛機的優化分為兩部分，一是針對庫位號的優化，改變傳統的庫位號排列方式，利用遺傳演算法建立起比較合理的庫位號排列順序；二是把堆垛機的運行線路簡化為旅行商問題，並做了適當的修改。
  4. The major tasks include : ( 1 ) expand the schema theorem for ga. the schema theorem with binary coding advanced by professor holland is expanded to limited integer, letter, floating point numbers the number of which value is limited, and their hybrid coding. ( 2 ) put forward replacing by the excellent chromosome ga ( recga ), superiority colony first ga ( scfga ) and improve the ga ; ( 3 ) make probability convergence analysis of recga using the theory of markov chain, random process ; ( 4 ) make convergence analysis of scfga using the principle of contractive mapping in functional analysis theory ; ( 5 ) design the test programs ( cap ) to resolve np problems ( course arrangement ) with gas ; based on recga, modify the arithmetic and then conduct tests

    主要有以下幾方面工作： （ 1 ）將二進制編碼遺傳演算法的模式定理擴展到由有限整數、字母或取值個數有限的浮點數編碼，或它們混合編碼的遺傳演算法范圍； （ 2 ）提出最佳個體替換策略遺傳演算法（ recga ） 、優勢群體優先策略遺傳演算法（ scfga ） ，對遺傳演算法進行改進； （ 3 ）使用隨機過程理論markov鏈對recga進行了收斂性分析； （ 4 ）使用泛函分析理論壓縮映射原理對scfga進行了收斂性分析； （ 5 ）使用遺傳演算法設計了解決np類問題（排課問題）的測試程序（ cap ） ，並根據recga對演算法進行改進並進行測試。
  5. At the same time, a new one called linguistic fuzzy cut - set method is presented in this paper. by using the new method, which can be applied to some cases, not only the best alternative but also a permutation is achieved

    基於此，我們提出了一種新的語言模糊集截集決策方法，在一定的范圍內，這種方法不僅能夠決策出最佳方案，而且還能給出備選方案間的一個清晰的排序。
分享友人
分享到 Line

分享到臉書