optimal solution 中文意思是什麼

optimal solution 解釋
最佳解
  • optimal : adj. 最適宜的；最理想的；最好的 （opp. pessimal）。
  • solution : n. 1. 溶解；溶液，溶體，溶劑。2. （補輪胎用的）橡膠水；〈美國〉藥水。3. 解決，解答 （of; for; to）; 解釋；（數學等的）解法，解式。4. 免除，解除。5. 【醫學】消散，消退。
  1. On the basis of analyzing limitation of using penalty function method dealing with constraints, an amending method based on the knowlege regulating strategy is suggested to amende the mapping relationship of infeasible constraints in decoding, thus making the regulated individuals map into the space to obtain the most promising optimal solution

    在分析懲罰函數法對約束處理效率較低的情況下，提出了一種基於知識調整策略的修正法，對解碼中不滿足約束的映射關系進行修正，使調整后個體映射到最有希望獲得最優解的空間中。
  2. 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最優解集逼近。
  3. Determining the optimal solution set for linear programming in general form

    一般形式線性規劃最優解集的確定
  4. The results were then applied to solve the centrosymmetric structural dynamical model updating problems. the optimal solution was entreated for the given pencil of matrices

    然後，將結果應用於中心對稱結構的動力模型修正問題中，對給定的矩陣束，求出滿足特徵方程且具有中心對稱特性的最佳矩陣束逼近。
  5. We use genetic algorithm ( ga ) to realize agents " coalition formation. ga can reduce the cost of searching the optimal solution or quasi - optimal solution, and enhance the efficiency of the whole system

    本文使用遺傳演算法來實現機器人聯盟形成，遺傳演算法能夠減少尋找最優解或可行解的開銷，從而提高整個系統的效率。
  6. Two methods are brought forward to obtain the optimal solution after gained the efficient solution : one is letting the non - discrimination of specific investor and the efficient borderline have a common tangent at a point, and this point is the optimal solution ; the other gains optimal solution basing on safety - first method

    在得到有效解后，本文提出採用兩種方法來獲取最優解：第一種方法是採用特定投資者的無差異曲線與有效邊界相切的方法得到最優解；第二種方法是採用安全第一方法來獲得最優解。
  7. A novel dynamic evolutionary clustering algorithm ( deca ) is proposed in this paper to overcome the shortcomings of fuzzy modeling method based on general clustering algorithms that fuzzy rule number should be determined beforehand. deca searches for the optimal cluster number by using the improved genetic techniques to optimize string lengths of chromosomes ; at the same time, the convergence of clustering center parameters is expedited with the help of fuzzy c - means ( fcm ) algorithm. moreover, by introducing memory function and vaccine inoculation mechanism of immune system, at the same time, deca can converge to the optimal solution rapidly and stably. the proper fuzzy rule number and exact premise parameters are obtained simultaneously when using this efficient deca to identify fuzzy models. the effectiveness of the proposed fuzzy modeling method based on deca is demonstrated by simulation examples, and the accurate non - linear fuzzy models can be obtained when the method is applied to the thermal processes

    針對模糊聚類演算法不適應復雜環境的問題，提出了一種新的動態進化聚類演算法，克服了傳統模糊聚類建模演算法須事先確定規則數的缺陷.通過改進的遺傳策略來優化染色體長度，實現對聚類個數進行全局尋優;利用fcm演算法加快聚類中心參數的收斂;並引入免疫系統的記憶功能和疫苗接種機理，使演算法能快速穩定地收斂到最優解.利用這種高效的動態聚類演算法辨識模糊模型，可同時得到合適的模糊規則數和準確的前提參數，將其應用於控制過程可獲得高精度的非線性模糊模型
  8. A new approach to the optimal solution to fuzzy linear programming

    線性規劃最優解新探
  9. In order to minimize total ordering and holding costs, a simple solution model using mixed integer programming techniques is presented to determine the optimal solution of the number of orders and timing of replenishment points, and quantity to be ordered at each replenishment

    此外，為達到極小化總訂購成本及總持有成本，本模型?用混合整?規劃技巧提供一個簡單求解方法，可同時求得最佳訂購次? 、訂購點及每次訂購? ? 。
  10. This algorithm easily escapes from local optimal solution, have high searching efficiency, simple structure, convenient use. aiming at iteration, optimization and matlab optimization toolbox having low precision and difficulty to choose initial vector on acquiring nonlinear equations ’ solutions, equations ’ solution problem is translated into genetic algorithm optimization problem. nonlinear equations ’ usual genetic

    針對迭代法、最優法、 matlab最優化工具箱求解非線性方程組中存在求解精度不高及初始矢量難選等問題，將方程組求解問題轉化為遺傳演算法函數優化問題，建立了非線性方程組通用的遺傳演算法解法，並將其用於汽車滑行試驗數據處理中。
  11. Application of partial least - squares regression on multi - dependent variable model analysis of quadratic regression design and its optimal solution

    偏最小二乘法在回歸設計多因變量建模中的應用及其優化
  12. 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 )

    摘要為了獲得整體近似最優解，提出採用蟻群演算法，搜索發電機可運行狀態的最優組合，並對蟻群演算法的數學模型進行分析，以參數的形式給出具有普遍意義的收斂性定理。
  13. The parameter control methods are in the contrast, which is to find a sequence of parameters that converge to optimal value and its corresponding points in converge to optimal solution

    參數控制演算法的基本思想正好相反，它是構造參數序列來逼近最優值，相應的迭代點列逼近最優點。
  14. Genetic algorithm, as a computational model simulating the biological evolution process of the genetic selection theory of dar - win, is a whole new global optimization algorithm and is widely used in many fields with its remarkable characteristic of simplicity, commonability, stability, suitability for parallel processing, high - efficiency, and practibility. on the other hand, there are many op - timization problems in the field of digital image processing, such as image compression, pattern - recognition, image rectification, image segmentation, 3d image recovery, image inquiry, and or so. in fact all these problems can be generalized as the problem of searching for a global optimal solution in a large solution space, which is the classic application field of genetic algorithm

    遺傳演算法是模擬達爾文的遺傳選擇和自然淘汰的生物進化過程的計算模型，是一種新的全局優化搜索演算法，具有簡單通用、穩定性強、適于并行處理以及高效、實用等顯著特點，在很多領域得到了廣泛應用，另一方面，在圖像處理領域有很多優化問題如圖像壓縮，模式識別，圖像校準，圖像分割，三維重建，圖像檢索等等，實際上都等同於一個大范圍搜索尋優問題，而最優化問題是遺傳演算法經典應用領域，因此遺傳演算法完全勝任在圖像處理中優化方面的計算。
  15. The optimal solution to the equal loader problem

    相同裝卸工情況下裝卸工問題的最優解
  16. According to the shortage of ga converging to a local optimal solution because of reducing the diversity of individuals, the theory of biological immune system is cited, the immune operators including calculation the densities of antibodies, activating or suppressing antibodies and making the memory cell are designed, and effectively combined with ga operators

    同時，針對遺傳演算法在收斂計算後期，由於種群趨向單一化，出現早熟現象而陷入局部最優解的缺點，借鑒生物原理的免疫系統，設計出抗體濃度計算、抗體的抑制/促進、構造記憶單元等多個免疫運算元，並與遺傳運算元進行有效結合。
  17. 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

    並且通過對排序問題、貨郎擔貨問題、指派問題、 hamilton問題等線形規劃問題典型算例的求解，表明新的分配原則在一定程度上簡化了原有的分配過程，具有更強的通用性。
  18. The algorithm can effectively o vercome immature convergence phenomenon in simple genetic algorithm ( sga ). it can improve not only antibody ' s similarity but also its diversity. and it can avoid local optimal solution and shorten searching time

    該演算法可以有效地克服基本遺傳演算法的未成熟收斂現象，既可以提高抗體的相似性又可以兼顧到抗體的多樣性，為避免演算法陷入局部最優解，縮短搜索時間提供了保證。
  19. Sensitivity analysis to the e ? cient frontier and the optimal solution of the portfolio with lower budge constraint are studied when mean or risk of some security is changeable ; ? the portfolio selection models with the ? xed consumption - income and the continuous - time incomplete information are introduced ? nally

    針對帶有投資資金下界約束的m - v證券投資決策模型，我們對其有效前沿和最優解進行了靈敏度分析，得到了當某一證券的期望收益率或風險發生變化時最優投資組合的有效邊界和最優解的變化情況；
  20. 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

    即使在和取定后，準鬆弛演算法的訓練和學習仍是一種局部最優化過程，它只是在初始權矩陣的附近找到第一個可行解就結束訓練，這類演算法並不能保證獲得全局最優解。
分享友人
分享到 Line

分享到臉書