面向多規(guī)格板材件的矩形工件排樣方法的研究
本文選題:排樣優(yōu)化 + 一刀切 ; 參考:《廣東工業(yè)大學》2015年碩士論文
【摘要】:面向多規(guī)格板材件的矩形工件排樣問題(2DVSBPP)就是指給出多種規(guī)格的矩形工件與板材,要求選出合適的板材組合,將矩形工件逐一排放在板材上,力求板材的總耗損最小,總利用率最高。作為一個經(jīng)典的NPC問題,2DVSBPP在工件的排樣過程中,通常面臨兩種工藝約束:“一刀切”約束和工件可旋轉(zhuǎn)性約束。本文針對多規(guī)格板材件的矩形工件排樣問題,提出了一種放寬式搜索算法(Relaxed Search Algorithm, RSA),該算法支持“一刀切”約束和矩形工件可旋轉(zhuǎn)約束,具體包括:1)多規(guī)格板材組合的構(gòu)造算法。依據(jù)矩形工件的總面積,選擇出可行的板材件組合,并將該組合按面積的增序方式排列。2)單塊板材件的排樣算法。提出了一種基于組化策略的單板材排樣算法,將矩形工件組合成一個單元體代替工件作為排樣的基本單元,再設(shè)定對工件組的定位規(guī)則,在板材件滿足“一刀切”約束的條件下,對板材件進行切割;進而,使用一種“排樣——切割”的遞歸排樣結(jié)構(gòu),以利用率是否低于給定的最低利用率作為回溯條件,配合最低利用率的二分遍歷式收斂,提高了單塊板材件的利用率。3)放寬式搜索算法。在對板材件組合進行選取與單塊板材件排樣算法生成之后,按初始組合的板材件的順序嘗試排樣,并逐步放寬組合的面積,從而逐步更換板材件,并使工件全部排放。4)后處理算法。通過良劣集交換的方式,對已排樣板材件上矩形工件的拆分與重組,進一步提高材料利用率。使用國際通用的Benchmark案例進行測試,RSA算法于若干文獻報道的算法,求解質(zhì)量有所提升;赗SA算法與企業(yè)實際生產(chǎn)需求,開發(fā)了一套面向多規(guī)格板材件矩形工件排樣的計算機輔助排樣系統(tǒng)。
[Abstract]:The problem of rectangular workpiece layout for multi-specification sheet parts (2DVSBPP) refers to the selection of suitable combination of rectangular workpieces and plates, which requires that the rectangular workpieces be discharged one by one on the plates, so as to minimize the total loss of the plates. The total utilization rate is the highest. As a classical NPC problem, DVSBPP usually faces two kinds of process constraints: "one size fits all" constraint and workpiece rotatability constraint in the process of workpiece layout. In this paper, a relaxed search algorithm (RSA) is proposed to solve the problem of rectangular workpiece layout for multi-specification sheet parts. The algorithm supports "one-size-fits-all" constraints and rotatable constraints for rectangular workpieces. It includes: 1) the construction algorithm of multi-specification plate combination. According to the total area of rectangular workpiece, the feasible combination of sheet parts is selected, and the combination is arranged in order of area. In this paper, a single plate layout algorithm based on histochemical strategy is proposed. The rectangular workpiece is combined into a unit body instead of the workpiece as the basic unit of layout, and then the location rules for the workpiece group are set. Under the condition that the sheet parts meet the "one size fits all" constraint, the sheet parts are cut; furthermore, a recursive layout structure of "layout-cutting" is used, with the backtracking condition of whether the utilization ratio is lower than the given minimum utilization ratio, Combined with the binary traversal convergence of the lowest utilization ratio, the utilization ratio of a single piece of plate is improved by using a 3. 3) relaxed search algorithm. After selecting the combination of sheet parts and generating the algorithm of layout of single piece of sheet, we try to arrange the parts in the order of the initial combination, and gradually relax the area of the combination, so as to replace the parts of the plate step by step. And make all the workpieces discharge 4. 4) post-processing algorithm. In order to improve the material utilization rate, the rectangular workpiece on the plank has been split and reorganized by exchanging the good and bad sets. An international benchmark case is used to test the RSA algorithm, which is reported in several literatures, and the quality of the solution is improved. Based on RSA algorithm and the actual production demand of enterprises, a set of computer aided layout system for rectangular workpiece layout of multi-specification sheet parts is developed.
【學位授予單位】:廣東工業(yè)大學
【學位級別】:碩士
【學位授予年份】:2015
【分類號】:TB49
【參考文獻】
相關(guān)期刊論文 前8條
1 崔耀東,周儒榮;單一尺寸矩形毛坯排樣時長板的最優(yōu)分割[J];計算機輔助設(shè)計與圖形學學報;2001年05期
2 崔耀東,張春玲,趙誼;同尺寸矩形毛坯排樣的連分數(shù)分支定界算法[J];計算機輔助設(shè)計與圖形學學報;2004年02期
3 劉勇彪;等截面長條類材料下料方案的最優(yōu)化設(shè)計[J];機械設(shè)計與制造;1994年05期
4 賈志欣,殷國富,羅陽,徐雷;矩形件排樣的模擬退火算法求解[J];四川大學學報(工程科學版);2001年05期
5 劉振宏;;NPC問題及某些近似算法(續(xù))[J];曲阜師院學報(自然科學版);1983年03期
6 肖九梅;;玻璃深加工的市場觀察及其發(fā)展分析[J];現(xiàn)代技術(shù)陶瓷;2011年02期
7 崔耀東;矩形毛坯下料排樣的一種優(yōu)化算法[J];機械工藝師;1998年06期
8 陶獻偉,王華昌,李志剛;基于填充算法的矩形件排樣優(yōu)化求解[J];中國機械工程;2003年13期
相關(guān)博士學位論文 前1條
1 李明;智能優(yōu)化排樣技術(shù)研究[D];浙江大學;2006年
相關(guān)碩士學位論文 前3條
1 李勇;近似算法在排樣優(yōu)化中的應用[D];華中科技大學;2005年
2 劉倩;“一刀切”約束下的矩形件優(yōu)化排樣算法比較與整合研究[D];河北工業(yè)大學;2012年
3 何霖;滿足“一刀切”約束的卷型材矩形件排樣方法研究[D];廣東工業(yè)大學;2014年
,本文編號:2094369
本文鏈接:http://sikaile.net/guanlilunwen/gongchengguanli/2094369.html