中英
1
sequencing problem中文是什么意思
- 中文翻譯
- 造句
- 日程計劃問題
- sequence n. 1.繼續(xù)；接續(xù)；連續(xù)。 2.順序；程序；次第；關(guān)系 ...
- problem n. 1.問題，課題；疑難問題；令人困惑的情況。 2.【 ...
- cscar sequencing problem 車輛排序問題
- job-shop sequencing problem 作業(yè)安排定序問題
- sequencing 測序，序列測定; 程序化; 次序安排; 定序; 排列程序，程序設(shè)計; 排序; 序列分析
- activity sequencing 活動排序
- address sequencing 地址排序
- automatic sequencing 自動測序; 自動定序; 自動排序
- bisulfite sequencing 亞硫酸鹽定序
- carbohydrate sequencing 糖測序; 糖定位; 糖作圖
- confirmatory sequencing 確證性測序,證實性測序; 確證性測序，證實性測序
- cycle sequencing 循環(huán)測序法
- dideoxy sequencing 雙脫氧序列測定
- direct sequencing 直接測序法
- directed sequencing 定向測序
- dna sequencing dna測序; dna定序; dna順序分析; 脫氧核糖核酸序列分析
- gene sequencing 基因測序
- general sequencing 常規(guī)序列
- genomic sequencing 基因組測序
- graphical sequencing 圖解順序
- instructional sequencing 指令定序
- logic sequencing 邏輯順序
- machine sequencing 機器序列
- multiprogramming sequencing 多道程序的定序; 多道程序定序
- oligosaccharide sequencing 寡糖測序
- The optimal design for a kind of sequencing problem of n - set
元集的一類排序問題的最優(yōu)設(shè)計 - The mathematical mode of a sequencing problem in management system is raised and it is solved successfully by designing the responding hga computer program
提出了生產(chǎn)管理中一類排序問題的數(shù)學(xué)模型并設(shè)計了有效的混合式遺傳算法求解程序。 - The assignment problem is a type of sophisticated combinatory designs which are difficult to be solved by the traditional methods , and so is the sequencing problem
指派問題和排序問題是一類復(fù)雜的組合問題，傳統(tǒng)的方法難于解決。相比之下，遺傳算法解決此類問題具有優(yōu)勢。 - Then , a restricted - aco ( ant colony optimization ) algorithm is proposed to solve the car - sequencing problem with buffer restriction under a round painted body storage , which reaches the objective to minimize the total conveyor stoppage time
在此基礎(chǔ)上，設(shè)計了約束集蟻群算法求解環(huán)型油漆車身緩沖區(qū)約束下，以傳送帶中斷時間最短為目標(biāo)的汽車制造排程問題。 - 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 )
本文主要針對終端區(qū)空中交通流量管理中的飛機排序問題，運用單機排序方法，將其轉(zhuǎn)化為一帶準(zhǔn)備時間的累積旅行商問題( ctsp ? rt ) 。 - 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
并且通過對排序問題、貨郎擔(dān)貨問題、指派問題、 hamilton問題等線形規(guī)劃問題典型算例的求解，表明新的分配原則在一定程度上簡化了原有的分配過程，具有更強的通用性。 - 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
元素判別值分配法是基于運輸問題引發(fā)出的通用解法，通過遍歷調(diào)運表中的各行各列計算出每個元素的分配優(yōu)先權(quán)重? ?元素判別值，然后依據(jù)元素判別值，根據(jù)調(diào)配原則進(jìn)行元素分配，使得分配方案在多數(shù)情況下一次分配即可獲得最優(yōu)解，但目前仍需要完善。 - A modified genetic algorithm ( mga ) framework was developed and applied to the flowshop sequencing problems with objective of minimizing mean total flowtime . to improve the general genetic algorithm routine , two operations were introduced into the framework . firstly , the worst points were filtered off in each generation and replaced with the best individuals found in previous generations ; secondly , the most promising individual was selectively cultivating if a certain number of recent generations have not been improved yet . under conditions of flowshop machine , the initial population generation and crossover function can also be improved when the mga framework is implemented . computational experiments with random samples show that the mga is superior to general genetic algorithm in performance and comparable to special - purpose heuristic algorithms . the mga framework can also be easily extended to other optimizations even though it will be implemented differently in detail
提出了一個改進(jìn)遺傳算法的結(jié)構(gòu)，并且應(yīng)用于帶有目標(biāo)是最小平均總流程時間的流水調(diào)度排序中.為了改進(jìn)一般遺傳算法的程序，兩個新的操作被引進(jìn)到這個操作中.這兩個操作為： 1 )過濾操作：過濾掉在每一代中的最壞的個體，用前一代中的最好的個體替代它； 2 )培育操作：當(dāng)在一定代數(shù)內(nèi)算法不改進(jìn)時，選擇一個培育操作用于培育最有希望的個體.通過大量的隨機產(chǎn)生的問題的例子的計算機實驗顯示出，提出的算法的性能明顯好于一般遺傳算法，并且和此問題的最好的專門意義的啟發(fā)式算法相匹配.新的mga框架很容易擴(kuò)展到其它最優(yōu)化當(dāng)中，只是實施的詳細(xì)的步驟有所不同
- sequencing problemとは意味：順序問題｛じゅんじょ もんだい｝
- 推薦英語閱讀
sequencing problem的中文翻譯，sequencing problem是什么意思，怎么用漢語翻譯sequencing problem，sequencing problem的中文意思，sequencing problem的中文，sequencing problem in Chinese，sequencing problem的中文，sequencing problem怎么讀，發(fā)音，例句，用法和解釋由查查在線詞典提供，版權(quán)所有違者必究。
關(guān)于我們
