- 組合最優(yōu)化問題
- optimization: n. 最佳化，最優(yōu)化。
- problem: n. 1.問題，課題；疑難問題；令人困惑的情況。 2.【 ...
- combinatorial optimization: 組合優(yōu)化; 組合最優(yōu)化
- combinatorial problem: 組合問題; 組合最優(yōu)化問題
- journal of combinatorial optimization: 優(yōu)化組合雜志
下載手機(jī)詞典可隨時隨地查詞查翻譯
combinatorial optimization problem中文什么意思
- 組合最優(yōu)化問題
下載手機(jī)詞典可隨時隨地查詞查翻譯
例句與用法
- 更多例句： 上一頁 下一頁
- Scheduling is one kind of important combinatorial optimization problem , which use some processors , machines or resources to accomplish optimally a batch of given tasks or jobs . the theory of scheduling has become a very important subject after half a century ' s development , and its application is very extensive
排序問題是一類重要的組合優(yōu)化問題，它是利用一些處理機(jī)、機(jī)器或資源最優(yōu)的完成一批給定的任務(wù)或作業(yè)，經(jīng)過近半個世紀(jì)的努力，排序理論已經(jīng)發(fā)展成一門相當(dāng)重要的學(xué)科，并且應(yīng)用非常廣泛。 - 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神經(jīng)網(wǎng)絡(luò)方法，同時分析了利用人工神經(jīng)網(wǎng)絡(luò)求解旅行商問題所存在的問題；最后利用混飩神經(jīng)網(wǎng)絡(luò)模型求解10城市旅行商問題和中國旅行商問題。 - This problem has vide applications in real areas , such as the design of water and electricity supply networks , and communication networks , etc . at the same time , the problem is also closely related with some classical combinatorial optimization problems , including the steiner problem and the travelling salesman problem , which are well - known . so , it is of great importance to study it
所謂歐幾里德2 -連通steiner網(wǎng)絡(luò)問題，就是對于給定的平面點集p ，確定它的長度最小的2 -連通steiner網(wǎng)絡(luò)，該問題與組合最優(yōu)化中著名的steiner問題和旅行售貨員問題有關(guān)，同時在水、電供應(yīng)網(wǎng)絡(luò)和通訊網(wǎng)絡(luò)等設(shè)計中也有非常廣泛的應(yīng)用，所以對該問題的研究具有重要的意義。 - Vsp is both a pivotal tache in logistic distribution optimization and indispensable in electronic commerce . it can increase logistic economic benefit and realize logistic rationalization . the systemic study on the theory and method of vsp is the base on the growth of logistic intensivism , the establishment of modem chain of command , the development of its and ec . now , the problem is not only applied to the field of auto transportation , but also to ship avigation communication electricity industry management computer application etc . the algorithm has been applied into many combinatorial optimization problems such as the trainman ' s shift arrangement in avigation the optimization design of cargo arrangement in ship company
對貨運車輛進(jìn)行調(diào)度優(yōu)化，可以提高物流經(jīng)濟(jì)效益、實現(xiàn)物流科學(xué)化。對貨運車輛調(diào)度優(yōu)化理論與方法進(jìn)行系統(tǒng)研究是物流集約化發(fā)展、建立現(xiàn)代調(diào)度指揮系統(tǒng)、發(fā)展智能交通運輸系統(tǒng)和開展電子商務(wù)的基礎(chǔ)。目前，問題的形式已有很大發(fā)展，該問題以不僅僅局限于汽車運輸領(lǐng)域，在水運、航空、通訊、電力、工業(yè)管理、計算機(jī)應(yīng)用等領(lǐng)域也有一定的應(yīng)用，其算法已用于航空乘務(wù)員輪班安排、輪船公司運送貨物經(jīng)過港口與貨物安排的優(yōu)化設(shè)計、交通車線路安排、生產(chǎn)系統(tǒng)中的計劃與控制等多種組合優(yōu)化問題。 - It can be boiled down to combinatorial optimization problem in mathematics . on the basis of summarizing the complexity and structural features of hmb and rules of its design and manufacture and analyzing the spatial relationship in 3d layout of hmb , the expressions of relevant variants are put forward using the object - oriented approach
在全面總結(jié)液壓集成塊設(shè)計問題的復(fù)雜性特點，以及集成塊類零部件的結(jié)構(gòu)特征和設(shè)計、制造信息組成規(guī)律的基礎(chǔ)上，本文深入分析了集成塊立體布局的空間關(guān)系，用面向?qū)ο蠓椒ǘx了與該問題有關(guān)的特征變量的示性表達(dá)式，給出優(yōu)化目標(biāo)和約束條件，進(jìn)而確立了集成塊設(shè)計問題的數(shù)學(xué)優(yōu)化模型。