整數規劃問題 的英文怎麼說
中文拼音 [zhěngshǔguīhuàwèntí]
整數規劃問題
英文
integer programming problem- 整 : Ⅰ形容詞1 (全部在內; 完整) whole; all; complete 2 (整齊) neat; tidy; orderly Ⅱ動詞1 (整理; 整...
- 數 : 數副詞(屢次) frequently; repeatedly
- 規 : Ⅰ名詞1 (畫圓形的工具) instrument for drawing circles 2 (規則; 成例) rule; regulation 3 [機械...
- 劃 : 劃動詞1 (撥水前進) paddle; row 2 (合算) be to one s profit; pay 3 (用尖銳的東西在別的東西上...
- 問 : Ⅰ動詞1 (請人解答) ask; inquire 2 (詢問; 慰問) question; ask about [after]; inquire about [aft...
- 題 : Ⅰ名詞1. (題目) subject; title; topic; problem 2. (姓氏) a surname Ⅱ動詞(寫上) inscribe; write
- 整數 : 1. (不含分數或小數的數) integer; whole number; integral number2. (沒有零頭的數目) round number; round figure
- 規劃 : 1 (比較全面的長遠的發展計劃) planning; programming; project; schematization; programme; plan 2 ...
- 問題 : 1 (需回答的題目) question; problem 2 (需研究解決的矛盾等) problem; matter 3 (事故或意外) tr...
-
Some research work for integer programming has been done by now, but less for integer nonlinear programming, and little has been done to it by initiatory method
對純整數非線性規劃問題目前已有一些工作,對非線性混合整數規劃問題的工作較少,用啟發式演算法解決混合整數非線性規劃問題的工作也不多見。The other classfies the calculation of mbps into the solution of inequation based on heuristic knowledge of mbps of optimal directional coordination setting in complex multiloop network and comes into equivalence of 0 - 1 integral second layout problem. on the basis of the principle of gene optimal evolution, a new approach to determine mbps is first presented and decreases the computational complexity of mbps problem
其二,利用復雜環網方向保護最優整定配合中最小斷點集( mbps )的啟發知識,將mbps的計算歸結為解不等式,進而等價為0 ? 1整數二次規劃問題,基於基因遺傳優化計算原理,首次提出了mbps問題的基因遺傳演算法,降低了問題的計算復雜性。Using method of oil - flow visualization techniques and measuring pressure distribution along airfoil chordwise and spanwise studies have been down for sidewall boundary - layer displacement effect in two - dimensional wind tunnel. three different chord models were tested in two different wind tunnel. in order to clarify the sidewall effects and study method of sidewall suction theory and sidewall interference correction method to remove effects of sidewall on model. the results of oil - flow test show that selection rational suction wary can obtain better testing results. by investigations on effects of the sidewall boundary layer suction and application of a sidewall interference correction method
為了很好地解決多機場航班隊列的擁塞問題,在將進場容量、離場容量與機場容量作為統一整體的情況下,充分考慮了機場間的網路效應,詳細研究了多機場航班隊列的優化問題,建立了多機場開放式非實時流量管理的數學模型,通過選取適當的決策變量,使其為線性0 - 1整數規劃模型,實現了中心流量集中管理.與其它演算法不同,本文提出的啟發式隱枚舉演算法能很好地解決此類問題,對某機場網路系統的模擬結果證明了所建模型、優化演算法及相應軟體的有效性和可靠性Transmission long - term planning is a dynamic, multi - stage and nonlinear combinative optimization problem. the thoughts of how to carry out multi - stage transmission network planning are analysed
電網長期規劃既要考慮各水平年的電網結構,又要考慮各水平年的方案過渡,是一個動態的多階段非線性整數規劃問題。New pso algorithm for minlp problems
用粒子群優化改進演算法求解混合整數非線性規劃問題Based on the genetic algorithm ' s global searching capability with probability regulation and euclid ' s space distance metric to settle multi - objective, the algorithm that integrates multi - objective ' s decision - making into the modified genetic algorithm to solute the optimal model with discrete variables and multi - objective is proposed. during the algorithm ' s design, the euclid ' s space distance metric is proposed to transform the multi - objective problem into single objective problem. and some modified measure to fitness function and crossover probability and mutation probability are used to improve the performance of the algorithm and avoid premature convergence
演算法設計過程中,利用歐幾里德空間距離準則和罰函數法,將含有約束條件的多目標規劃問題轉化為無約束的單目標優化問題;針對簡單遺傳演算法出現的早熟,構造隨進化代數動態調整適應度的適應度函數和隨個體適應度自適應調整的交叉、變異概率;提出比例選擇與精英保留策略相結合的選擇、兩點交叉和簡單變異的改進遺傳演算法。Secondly, in the first phase, this paper solves the inventory supplement sub - problem through integer programming model, using the reduction of vehicle routes as the breakthrough to this problem, divides a whole distribution region into many customer subsets by radius - circle partitioning method, determines the optimal number of vehicle of service distribution region, applies two practice - oriented conclusions to reduce the number of routes on the basis of customer grouping, thus decreases considerably the variable scale of integer programming, and solves the problem through professional software to fix inventory supplement plan in plan period
其次,在第一階段使用整數規劃數學模型來規劃庫存補充計劃子問題,以減少車輛巡迴路線數目為求解該整數規劃的突破口,提出與固定劃分策略( fpp )相似的客戶分組思想,通過徑?環切割法把整個配送區域劃分成多個客戶子集,實現客戶分組並確定服務整個配送區域的最佳車輛數目。在客戶分組的基礎上建立了精簡路線的整數模型,然後通過運用兩條基於實際經驗的判斷來進一步減少巡迴路線數目,進而極大地減少了整數規劃的變量規模,並利用專業的求解軟體來求解該整數規劃問題,從而確定計劃期的庫存補充計劃。An application of genetic algorithms with initial group floating for mixed integer nonlinear programming
初始群體飄移遺傳演算法用於解混和整數非線性規劃問題The filled function method for a class of discrete nonlinear mixed - integer programming
一類非線性兩級混合整數規劃問題的全局最優解的近似演算法Chaos genetic algorithm method for a class of nonlinear bilevel mixed integer - programming problem
基於混沌遺傳演算法的一類非線性兩層混合整數規劃問題求解A multi - objective mixed integer programming model, which abstracted the city logistics delivery system lrp, had been presented
經進一步的研究,發現城市物流配送系統lrp實質上是一個多目標混合整數規劃問題。A new branch and bound algorithm for solving complex integer quadratic programs
解復雜二次整數規劃問題的新型分枝定界演算法By theoretical analysis and numerical experimentation, the genetic method for large scaling multi - apex and no smooth mixed integer nonlinear programming can get a good global solution, and it is better than other algorithms used to resolve in the feasibility, stabilization and convergent speed of the solution
理論分析及數值試驗表明:該演算法對大范圍、多峰、非光滑混合整數規劃問題有較好的全局求解能力,在解的精度、穩定性和收斂速度等方面優於一般的求解混合整數非線性規劃的演算法。The steam turbine system and the boiler system construct respectively an integral linear 0 - 1 problem and a non - linear problem
汽輪機系統和鍋爐系統分別構成線性混合0 - 1整數規劃問題和非線性規劃問題。However, signals take effect by the switch of signal phases, which introduces integer control values into the traffic control problem, so the traffic control problem becomes a large - scale mixed integer programming problem, the computation of which requires an exponential - complexity optimiz ation algorithm
但是,信號燈通過相位切換對交叉口進行控制,同時也在交通控制模型中引入了整數決策變量,使交通控制模型成為一個大規模混合整數規劃問題,需要指數復雜度的優化演算法。Many problems of engineering and system are integer or mixed integer programming problems. lt is well known that the problem of integer programming is a np - hard problem, and the method for it is exponential complex
工程、系統問題中有許多問題屬于整數或混合整數規劃問題。眾所周知,線性整數規劃問題是np - hard問題,求解該問題的精確解演算法具有指數復雜性。The model is formulated as a non - linear integer - programming problem. it ' s a np - hard problem, and it ' s hard to be resolved
從模型的形式上看,該模型屬于運籌學領域中的非線性0 - 1整數規劃問題,在理論界屬于np - hard問題,求解起來很困難。Therefor, the approximate and evolutionary methods for integer programming have been developed quickly in these years
因此,線性整數規劃問題的近似演算法和演化演算法近年來得到快速發展。Reactive power optimization which can improve the quality of system voltage and reduce reactive power loss has not been solved completely because of the complexity of mixed - integer nonlinear programming
電力系統無功優化控制對于提高系統電壓質量、降低有功網損具有重要的意義。無功優化問題是非常復雜的非線性混合整數規劃問題,一直沒有得到很好解決。On the base of analysing the shortcoming of genetic algotithms, three improved techniques for genetic algorithms are bring forward in this paper : fuzzy penalty fitness function, random dislocation arithmetic crossover, fuzzy parameter adjust policy, which improve genetic algorithms capability of global convergence and convergent speed. at the same time, the improved genetic algorithms are applied to nonlinear mixed integer problems and complex nonlinear function optimization
在分析實數型遺傳演算法不足的基礎上,本文研究了遺傳演算法的關鍵技術,分別提出了模糊懲罰評價函數、隨機錯位算術雜交運算元、模糊自適應參數控制等改進技術,以提高遺傳演算法的全局收斂性和收斂速度,並應用於求解非線性混合整數規劃問題和復雜高維的函數優化問題。分享友人