integer programming algorithm 中文意思是什麼

integer programming algorithm 解釋
整數規劃演算法
  • integer : n. 1. 【數學】整數 （opp. fraction）。2. 完整的東西，整體。
  • programming : 編程序的
  • algorithm : n. 【數學】演算法；規則系統；演段。
  1. Ant colony optimization algorithm for nonlinear integer programming

    非線性整數規劃的蟻群演算法
  2. Firstly, a 0 - 1 integer programming mathematical model is constructed to describe tail - number - assigning work happened in domestic airline, since the problem is npc, a unified polynomial algorithm which satisfies engineering requirement is unavailable. illuminated by the practical experience, a specific tna problem is classified into one of three typical tna modes : tna based on fleet dispatching commands, tna based on fleet balance application, tna based on minimum fleet requirement ; secondly, by simplifying and relaxing some minor constraints, corresponding mathematical models and heuristic algorithms are reconstructed for each typical tna mode ; finally, computing complexities are discussed

    為此論文在借鑒手工編制排班計劃經驗的基礎上，將一個具體的飛機排班問題，歸結為三種典型排班模式中的一種，即：基於飛機調度指令要求的排班問題，基於飛機使用均衡要求的排班問題和基於最少需用飛機數的排班問題，對于每種典型的飛機排班模式，在對次要的約束條件進行簡化、松馳的基礎上構造出相應的能夠滿足工程應用要求的啟發式演算法，並分析了演算法的復雜性。
  3. A branch and bound algorithm for solving a class of nonlinear 0 - 1 knapsack problems is proposed, in which branching is common 0 - 1 variables one and a better feasible solution is found by a simply integer heuristic method as well as a lower bound of the optimal value of the subproblem in the each branching node is determined by solving linear programming relaxed approximate problem to be obtained with linear relaxed technique

    摘要構造出了一類可分離非線性0 - 1背包問題的分枝定界演算法，分枝的過程是普通的0 - 1變量分枝，用簡單的取整啟發式法確定更好的可行解；而在每個分枝結點處用線性鬆弛技術確定了它的子問題的一個線性規劃鬆弛逼近，由此得到最優值的一個下界。
  4. Based on the modified house of quality, the chance - constrained programming model is developed to determine the optimal striving targets by stochastic simulation and genetic algorithm, and the 0 - 1 integer programming model is derived for the decision - making of reengineering objectives

    基於改進的質量屋建立了機會約束規劃模型，通過隨機類比和遺傳演算法確定最佳奮斗目標；建立了0 - 1整數規劃模型，用於經營過程重構目標的決策。
  5. Methods such as branch and bound algorithm, mixed integer programming, transportation model and separable linear programming method have been used in recently years. others are heuristic methods like genetic algorithm

    近年來求解選址模型用得較多的數學優化方法有分支定界法、混合整數規劃法、運輸模型法、可分離線性規劃法。
  6. Abstract : a new algorithm w - ecop is presented to effect incremental changes on a standard cell layout automatically. this algorithm deals with cell inserting and cell moving based on rows instead of on cells as most placement algorithms usually do. an integer programming problem is formulated to minimize the adjustment on the initial placement and a heuristic method is presented to search for a shifting path so as to optimize the wirelength. test of w - ecop on a group of practical test cases shows that the algorithm can successfully accomplish incremental placement with good quality and high speed

    文摘:提出了一種新的增量式布局方法w - ecop來滿足快速調整布局方案的要求.與以前的以單元為中心的演算法不同，演算法基於單元行劃分來進行單元的插入和位置調整，在此過程中使對原布局方案的影響最小，並且盡可能優化線長.一組從美國工業界的測試例子表明，該演算法運行速度快，調整后的布局效果好
  7. The thesis uses 0 - 1 integer linear programming to construct algorithm - hardware mapping models. based on bounds of data flow graph proposed by barwell and hodges, cost function combining iteration periodic bound with periodic delay bound and several constraints are proposed

    根據已提出的數據流圖的界，確定規劃和映射模型的目標函數，即最小化循環周期界和周期延遲界，進而建立規劃和映射問題的一系列的約束條件。
  8. Chaos genetic algorithm method for a class of nonlinear bilevel mixed integer - programming problem

    基於混沌遺傳演算法的一類非線性兩層混合整數規劃問題求解
  9. A network based approach, called extended petri - nets that represents the design of the supply chain as an abstracted network with " and " and " or " nodes, is presented. based on their substantial disadvantages of linear programming, integer programming, nonlinear programming and genetic algorithm in dealing with a typical supply chain, a constraint based genetic algorithm as part of the extended petri - nets approach is introduced to search for improvements in the design that satisfies the constraints imposed on the system. a prototype testing system is constructed, which is followed by an example together with a description of the small automobile supply chain system implementation

    兩北丁業人學博十學位論義通過對鏈式供需鏈的結構分析，把鏈式供需鏈的設計優化轉化為多階段決策問題，在此基礎上建立了設計優化模型，並提出前向與後向兩種動態規劃求解演算法；鑒于線性規劃、整數規劃、非線牲規劃以及遺傳演算法在解決網狀供需鏈設計優化問題時皆存在著不足，本文對petri網進行了改進，提出了擴展petri網的概念，用於把網狀供需鏈抽象為一個具有「與」和「或」變遷節點的網路，並在前人工作的基礎上，把基於約束的遺傳演算法cbga與擴展petri網結合起來，用
  10. Because the second math model belongs to nonlinear programming problem, we adapted generic algorithm. at last generic algorithm is well compared with integer programming algorithm in method step and method principle

    對模型二，因為是一個非線性規劃問題，故可採用遺傳演算法求解，並詳細介紹了兩種求解演算法的步驟，原理，以及這兩個模型間的異同點和優缺點。
  11. 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

    但是，信號燈通過相位切換對交叉口進行控制，同時也在交通控制模型中引入了整數決策變量，使交通控制模型成為一個大規模混合整數規劃問題，需要指數復雜度的優化演算法。
  12. A modified algorithm for nonliear integer programming

    改進的非線性整數規劃演算法
  13. A new algorithm for 0 - 1 integer programming

    1型整數規劃解法芻議
  14. An algorithm for solving the global optimization of nonlinear integer programming

    一種求非線性整數規劃全局最小解的演算法
  15. About the first math model, we adapted integer programming algorithm to resolve

    然後在此基礎上，對模型一採用整數規劃演算法進行求解。
  16. Integer programming model and modified genetic algorithm for optimal turned - out slab pile for hot rolline schedule

    熱軋實施計劃中最優倒垛問題的整數規劃模型及遺傳演算法
  17. This paper also suggests an effective method of preventing premature of genetic algorithm is presented based on the analysis of causes of premature of genetic algorithms. some different local optima are found firstly and the best of these solutions is regarded as the last result. 0 - 1 integer linearity programming is an important integer programming model

    另外ga在應用中還存在早熟收斂的問題，本文介紹了解決該問題的一種策略，對一個優化問題連續多次運行ga以求得多個不同的局部最優解，再從這多個局部最優解中挑選一個最優的作為演算法的最後結果，該方法可大大提高了ga求得真正全局最優解的可能性。
  18. The extended max - rwa problem is formulated as two integer linear programming ( ilp ) from the different viewpoint, and then solved using genetic algorithm and tabu - search algorithm respectively. a dynamic routing and wavelength assignment algorithm ( lcwa ) for limited - range wavelength conversions is proposed

    從不同角度出發，給出了max - rwa問題的兩個整數線性規劃模型，隨後分別使用遺傳演算法和禁忌搜索演算法求解了波長轉換范圍受限條件下的靜態max - rwa問題。
  19. A path - wise test data generation framework is proposed in this thesis, whose fundamental algorithm is the improved method. this framework adopts a constraint solver using linear programming and linear ( mixed ) integer programming methods for w on which all of the predicate functions with respect to the input variables are linear. for w on which there is nonlinear function ( s ) with respect to the input variables

    該框架以改進后的迭代鬆弛法為核心演算法，對于謂詞函數均為輸入變量的線性函數的程序路徑，採用基於線性規劃、線性（混合）整數規劃的約束求解器；對于謂詞函數中含有輸入變量的非線性函數的程序路徑，採用線性規劃、線性（混合）整數規劃和最小二乘解法相結合的約束求解器。
分享友人
分享到 Line

分享到臉書