cutting-stock problem 中文意思是什麼

cutting-stock problem 解釋
切段問題
  • cutting : n 1 切斷,切下;切片;【園藝】扦插,插條;〈英國〉剪裁,(報紙等的)剪輯;(寶石等的)加工,琢磨...
  • stock : n 〈德語〉 滑雪手杖。n 1 (樹等的)干,根株,根莖。2 【園藝】砧木;苗木;原種。3 〈古語〉木塊,木...
  • problem : n. 1. 問題,課題;疑難問題;令人困惑的情況。2. 【數、物】習題;作圖題。3. (象棋的)布局問題。adj. 1. 成問題的;難處理的。2. 關于社會問題的。
  1. Based on analyzing the mathematical models for one - dimensional cutting stock problem, a greedy algorithm has been constructed, which is an approximate algorithm

    摘要在對一維下料方案數學模型分析的基礎上,提出了一種基於貪心演算法的求解方法。
  2. Based on the analysis of the features, key procedure and research tendency of various algorithms for cutting stock problem, this paper proposes that the increasing of material utility ratio can not be reached by solving cutting stock problem only. a integrated solution should be resolved from both management and application optimization technology in view of system engineering

    通過分析各排樣演算法的特點、關鍵步驟與研究趨勢,本文從系統工程的觀點出發,指出提高材料利用率不僅僅只是一個排樣問題的求解,而是要從下料生產管理和優化技術方法兩個方面同時入手,建立完整的解決方案。
  3. This paper points out that it is efficient to code the string of index of the parts in adopting ga to solve cutting stock problem after analyzing the features and research tendency of ga. this paper presents suitable operators of selection, crossover and mutation for the coding method. these operators are used in the calculation of one - dimensional and rectangular cutting stock problems

    本文為這種基因編碼設計了實用的選擇、交叉、變異遺傳運算元,並將其用於一維下料方案優化問題、矩形件排樣問題的求解;討論了不同工藝要求條件下的適應度定義方法,並用四川大學博士學位論文計算實例驗證了其尋優效果。
  4. The paper dealt with the optimal design problem of stock layout patterns of saw cutting blanking for rectangular pieces of a single size, proposed a kind of optimal layout method of rectangular pieces of a single size, pointed out the mathematical basis, selective conditions of the optimal solution and layout disposal of the particular solution

    摘要討論單一尺寸矩形件鋸切下料排樣方式的最優設計問題,提出一種單一尺寸矩形件優化排樣方法,給出這一排樣方法的數學依據、優化解的選擇條件和特殊解的排樣處理。
  5. The paper based on the idea of k - opt algorithm for tsp, present a swap algorithm for the one - dimensional cutting - stock problem

    摘要根據旅行商問題( tsp )的鄰域搜索演算法的思想,提出了型材下料問題的一種優化演算法。
  6. Then, this paper deeply studies the key technology of the cutting stock system for project manufacture enterprises : optimized cutting stock, graph disposal and system integration, etc. after analyzing the working flow of the column generation technology, brings forward the interpolation algorithm for solving non - guillotine cutting stock problem. image processing technologies including parts image processing and result image generating are studied

    分析了優化下料演算法? ?列生成法的求解流程,提出了插補求解二維non - guillotine切割的啟發式演算法;分析了圖形處理技術,包括零件圖預處理技術和結果圖生成技術;提出了系統集成的方案,實現了優化下料技術與cad 、 capp 、 cam技術的有機集成。
  7. In this paper, a new dynamic programming algorithm for unconstrained 2d stock cutting problem is presented

    摘要本文給出了一種求解無限制板材下料問題的動態規劃解法,對該演算法的計算復雜度進行了分析。
  8. The principal working and conclusions in this paper are as follows : 1 ) by discussing the problem of two - dimensional cutting stock in the field of generator manufacture, this paper expounds the important value of increasing the material utility ratio and researches the method of achieving the optimal nesting cad / cam system

    本文的主要研究內容與成果如下: 1 )分析了我國發電設備製造中板材下料加工的概況,闡明了提高板材下料利用率對企業的重要意義,討論了發電設備板材下料cad cam系統的軟體開發實現方式。
  9. Then, the cutting - stock technology in the product design system oriented to the optimized utilization of material resource is deeply studied. in this paper, the mathematics model of two - dimensional guillotine cutting - stock problem based on inventory is set up. to solve the mathematics model above, the iterative solving method through wiping off worse layout is put forward ; on the base of the column generation formulas that are deduced to solve multi - material two - dimensional guillotine cutting - stock model , the column generation algorithm is brought forward by using column generation technology ; the solution of two - dimensional knapsack problem and one - dimensional knapsack problem is studied ; the concept of the value of

    給出了基於庫存的二維guillotine優化下料問題的數學模型,提出了一種新的求解方法? ?去差迭代求解法;引入了列生成技術,在推導多原材二維guillotine優化下料模型求解的列生成數學形式的基礎上,給出了列生成迭代求解演算法,研究並分析了二維背包問題和一維背包問題的求解演算法;提出了板材排樣價值概念,建立了板材排樣價值的估計方法;論文同時針對優化下料技術當前應用中存在的問題,提出了一種基於asp ( applicationservicesprovider )模式的多軟體協同優化下料解決方法並給出了該方法基於agent思想的具體實現技術。
  10. An integer nonlinear programming approach optimizing cutting stock problem

    整數非線性規劃方法優化下料問題
  11. At the same time, crossover and mutation are developed to construct genetic algorithm of one - dimensional cutting stock problem

    本文採用了最優保存策略來保持種群中的優良個體,使得產生的遺傳演算法更加有效。
  12. Finally, two new genetic algorithms are applied to solve the cutting stock problem. the results demonstrate that new genetic algorithms have predominance in the general cutting stock problems

    最後,本文對兩個新的遺傳演算法進行了數值試驗,結果表明新演算法能有效地求解一般下料問題。
分享友人