近優解 的英文怎麼說

中文拼音 [jìnyōujiě]
近優解 英文
near-optimum solution
  • 近 : Ⅰ形容詞1 （空間或時間距離短） near; close 2 （接近） approaching; approximately; close to 3 （親...
  • 解 : 解動詞（解送） send under guard
  1. The method proposed in this thesis do well in solving the problems of multi - damping - ratio - spectra simulation. it is convenient to obtain the pareto optimal solution set of the multi - object question by using implicit parallel genetic algorithms and the method can meet the practical needs for simulating ground motions coinciding with multi - damping - ratio - spectra in seismic design. the crossing rate and variance rate are important parameters of genetic algorithms which affect the rate of convergence, the adapting rate of cross and variation in this paper can auto - adapt and according to stand or fall of current sample, it assures the sample approach to the pareto optimal solution set in fast convergent speed

    較好地解決多阻尼比反應譜擬合問題；本文方法通過一次運行就能獲得一組具有集系特性的地震動，在擬合多阻尼比反應譜的人造地震波集系的模擬方面有傳統方法所不能比擬的優勢，產生的人造波或人造波集系可滿足工程抗震設計需要；在遺傳演算法中，交叉概率和變異概率是影響收斂速度的重要參數，本文採用的改進自適應交叉概率和變異概率，可以根據當前樣本的好壞程度來自動地選擇適當的交叉概率和變異概率，以保證演算法始終以較好的速度向pareto最優解集逼近。
  2. The optimum designs of a good and applied outer pressure tank structure of submarine ? quasi - homocentric structure, based on approximate analytical methods and finite element stress analysis method are made

    提出了準同心圓式潛艇外部耐壓液艙結構是一種優良實用的結構型式，給出了這種結構基於近似解析法和基於有限元應力分析的結構優化設計方法。
  3. The parameter control methods are very similar to penalty function methods, both of them are to solve constrained optimization problems by solving a series of sub - unconstrained optimization problems. but parameter control methods are different from penalty function methods. firstly, the penalty coefficient of penalty function methods are preassigned, while the parameters of parameter control methodsare generated automatically according to some rule prescribed

    參數控制演算法雖然與罰函數法非常類似，都是通過求解一系列無約束極小化問題來逼近約束優化問題的最優解，但罰函數法中的罰因子是預先設定的，而參數控制演算法中的參數是自動產生的。
  4. Bell system technical, 1970, 49 : 291 - 307. 10 wu f, huberman b a. finding communities in linear time : a physics approach. eur

    本質上， dm演算法是一種啟發式的貪心優化演算法，它採用局部搜索方法能逐步逼近地為預先定義的目標函數找到一個近似最優解。
  5. For the purpose of discovering the near - globally optimal solution, this paper proposed a hybrid approach of ant colony algorithm and sequential quadratic programming ( sqp )

    摘要為了獲得整體近似最優解，提出採用蟻群演算法，搜索發電機可運行狀態的最優組合，並對蟻群演算法的數學模型進行分析，以參數的形式給出具有普遍意義的收斂性定理。
  6. When the approximate optimized scheme of common job - shop scheduling discussed in the paper is applied to the practice, it could make some parts of working procedures of processing product be the tail end of the tree that working procedures of this product makes, that is, these parts of working procedures still makes a tree like the whole process. during the processing of one product, if another product needed to be processed, we could process it with the mentioned method solving static job - shop scheduling. therefore, a new method to solve dynamic job - shop scheduling is put forward and validated by practice

    同時採用本文提出的解決一般job - shop調度問題的全新近優解方案，可以使得產品所加工的部分工序是產品的加工工藝圖（加工樹）某些枝杈的末端，即產品未加工的剩餘部分工序的加工工藝圖仍然是一棵加工樹，這樣對于正在加工的產品，如果有另外需要加工的產品，可一併按上述解決靜態job - shop調度問題的方法處理，於是本文又提出了一個解決動態job - shop調度問題的新方法，並通過實例加以說明。
  7. A new numerical algorithm integrating a quasi - analytic numerical algorithm with the gear numerical algorithm is used to solve the ordinary differential equations with stiff problem. to accelerate the solving of ode, the optimum step method is introduced into the composite numerical algorithm

    針對重整反應模型方程的特殊結構和剛性問題，提出了一種形式更簡單方便的近似解析數值演算法和吉爾法相結合的混合數值演算法，並引入了最優步長方法。
  8. The basic thought is to divide the cities which are close to each other into a group ( physical area ) by applying sorting neural network, find out the optimal path by the improved hnn, and then calculate the local optimal path by using the same method, and finally get the whole optimal path, which are described as following : a assembly s of cities is grouped into some subsets according to their physical location and we can get, and then get the optimal, path of tsp of s = { s, i = 1, 2, n } through the given method, as well as the st

    基本思想是利用聚類神經網路先把地理位置上相互靠近的城市劃分為一個集體單位（一個物理區域） ，用改進的hopfield神經網路演算法求解各個區域間的最優（或近似最優）路徑，然後再在每一個區域內部用同樣的方法來求解其局部的最優（或近似最優）路徑，這樣可以最終得到全局的最優（或近似最優）解。描述如下：設有城市集合s ，按城市的地理位置把s劃分為若干子摘要2集，得s ijs ， ，其中廠s ； d ， i一口求得集合i叫s s ； i習， 2 ， … n的tsp最優路徑，再依次求得子集s ；內部的tsp最優路徑，即得最終優化路徑m一） s一） …一寧s ； di
  9. And it is obvious that pseudo - relaxation is a kind of local optimization method, so it cannot guarantee to get the global optimal solution. in this paper, a novel learning algorithm eprbam evolutionary psendo - relaxation learning algorithm for bidirectional association memory employing genetic algorithm and pseudo - relaxation method is proposed to get feasible solution of bam weight matrix

    即使在和取定后，準鬆弛演算法的訓練和學習仍是一種局部最優化過程，它只是在初始權矩陣的附近找到第一個可行解就結束訓練，這類演算法並不能保證獲得全局最優解。
  10. The search space is divided into many small areas, and each area is given a certain pheromone value. according to the state transition rules, the artificial ants move to the next solution which is generated randomly or calculated by particle swarm optimization. local search strategy is also added into psaco so that the search speed and precision is enhanced

    該演算法首先將連續對象定義域平均分成許多邊緣相互重疊的小區域，區域的稠密程度決定了演算法解的精度，每個區域賦予一定的信息素值;螞蟻根據狀態轉移規則在隨機生成的可行解與利用微粒群演算法得出的可行解之間選擇下一步要去的位置;引入局部尋優策略，加強近似最優解鄰域內的局部搜索，提高搜索速度和精度。
  11. Secondly, the penalty coefficient may converge to infinity in many situations when the iterative point is closely near the bound of feasible set, while the parameters are bounded if the solution set of constrained optimization is nonempty, which is available for numerical computation

    另外在很多情況下，罰函數法中的罰因子當迭代點接近可行域邊界時趨于無窮大，而參數控制演算法中，只要約束優化問題有最優解，則參數是有界的，這對數值計算是有利的。
  12. According to an analysis of the current various optimum methods, a new mixed type of genetic algorithm are proposed, which overcomes some typical limitations such as the decrease of hunting efficiency lack of hunting competence near the optimal solution. with a model for optimum design setup, the system brwcad are worked out with the advanced language visual basic6. 0 and the object - oriented technique

    此外，針對衡重式擋土墻常規設計存在的弊病，指出其優化設計的必要性與重要性，並在比較分析已有優化方法優缺點的基礎上，引入並提出了一種新型混合遺傳演算法進行優化設計，解決了臨近最優解搜索效率降低、搜索能力不足等缺陷。
  13. 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 ）安排工序的演算法，用實例加以驗證，並給出結果甘特圖。
  14. Abstract : in this paper, we propose an improved lagrangian relaxation algorithm to solve job - shop scheduling problems. besides the addition of augmented objective, we expand the search scope of near - optimal solutions and improve the computational efficiency greatly by restricting the solution scope of sub - problems and modifying the search method of dual problem. at the same time, we develop a genetic algorithm combining with the lr ( lagrangian relaxation ) method. using the numerous useful solutions we get in the lagrangian relaxation as the original genes, we can improve the solution further. test results show that these methods achieve satisfied outcome for job - shop problems. they can also be applyed to other programming problems with constraints

    文摘:針對車間調度問題，提出了一種改進的拉氏鬆弛演算法.在增加輔助目標函數的基礎上，通過對子問題的限制和搜索策略的改變，使拉氏演算法的計算量減少，近優解的搜索能力有很大改善.本文還提出了一種基因優化演算法，充分利用拉氏演算法得到的多個近優解，進一步優化結果.模擬結果表明對車間調度問題得到了較好的結果.本方法也可用於其它有約束的規劃問題
  15. The number of the hidden layers of mul - tilayer perceptrons ( mlps ) is analyzed, and three - layer perceptrons neural network is adopted ; by analyzing the mechanism of the neural cells in hidden layer, a method for combining genetic algorithm and bp algorithm to optimize the design of the neural networks is presented, and it solves the defects of getting into infinitesimal locally and low convergence efficiently, it can also solve the problem that it can usually obtain nearly global optimization solution within shorter time through using genetic algorithm method lonely ; several examples validate that this algorithm can simplify the neural networks effectively, and it makes the neural networks solve the practical problem of fault diagnosis more effectively

    對多層感知器隱層數進行了分析，確定採用三層感知器神經網路;通過對隱層神經元作用機理的分析，引入了遺傳演算法與bp演算法相結合以優化設計神經網路的方法，有效地解決了bp演算法收斂速度慢和易陷入局部極小的弱點，還可以解決單獨利用遺傳演算法往往只能在短時間內尋找到接近全局最優的近優解的問題;通過實例驗證了這種演算法能夠有效地簡化神經網路，使神經網路更加有效地解決實際的故障診斷問題。
  16. The solution of the original nonlinear problem is reasonably approximated by means of a series of random vibration analyses for the linearized structure using the pseudo excitation method

    本文方法充分利用了虛擬激勵法求解復雜線性結構高效、精確的優點，以一系列線性問題的迭代分析，迅速地求得原非線性問題合理的近似解。
  17. The smaller the value of the merit function is, the closer the iteration point is to the solution

    當價值函數的值越小時，迭代點越靠近最優解。
  18. The other is the modern frequency domain method performed by rosenbrock. the design objective is the diagonal dominance, not the diagonalization, so it may avoid the limitation of the complete decoupling. it is an approximate decoupling method

    其二是以rosenbrock為代表的現代頻域法，其設計目標是被控對象的對角優勢化而非對角化，從而可以在很大程度上避免全解耦方法的缺陷，這是一種近似解耦方法。
  19. In the first algorithm, a solution to transcendental equations is converted into a solution to roots of a monic polynomial, and the latter can be fulfilled easily by using functions roots or solve in matlab. in the second algorithm, taking advantage of the property that the distance between solves in a circular domain and the center of the circle is less than that of solves out

    方法一：將對超越方程的求解轉化為對首一多項式的根的求解，然後利用matlab的roots或solve函數進行求解；方法二：利用圓形區域內超越方程的解與圓心的距離小於區域外的解與圓心的距離和fsolve函數求解方程時優先搜索離初值最近的解的特點，將圓心坐標值作為fsolve函數求解的初值，先求解出包含指定區域的圓形區域內的解，再從中找出指定區域內的解。
  20. The approximate optimal solution for the generalized time optimal control system with delay

    具有時滯的廣義時間最優控制問題的近似最優解
分享友人
分享到 Line

分享到臉書