二維剪切下料問題的三階段排樣方案優(yōu)化算法研究
發(fā)布時(shí)間：2018-08-28 07:55
【摘要】：下料問題是一種計(jì)算復(fù)雜度很高的組合優(yōu)化問題,具有很深的工程應(yīng)用背景,如機(jī)械制造的金屬切割、家具業(yè)的木材切割、建筑業(yè)的玻璃切割、印刷業(yè)的排版、化工業(yè)的塑料加工、服裝業(yè)的布料剪裁等都屬于此類應(yīng)用。優(yōu)化算法可以為下料問題提供合理的排樣方案,降低材料成本,簡(jiǎn)化切割操作,從而降低生產(chǎn)成本,提高企業(yè)競(jìng)爭(zhēng)力。本文以二維剪切下料問題為研究對(duì)象,從以消耗的板材數(shù)量最少為目標(biāo)的三階段同質(zhì)(3H)排樣方案開始,擴(kuò)展到考慮余料標(biāo)準(zhǔn)化的排樣方案,最后研究了考慮余料標(biāo)準(zhǔn)化的余料下料問題。達(dá)到板材用量最少的同時(shí),提高余料的二次利用價(jià)值和可用性。并在后繼生產(chǎn)周期中合理優(yōu)先使用余料,進(jìn)一步減少板材用量和材料浪費(fèi),減少?gòu)U料對(duì)環(huán)境的污染。本文從以下三個(gè)方面研究二維剪切下料問題,主要的工作和創(chuàng)新點(diǎn)包括:(1)針對(duì)普通的二維剪切下料問題,采用迭代順序價(jià)值修正算法,迭代生成多個(gè)3H排樣方案,從中選擇板材用量最少者作為剪切下料問題的解。將排樣方案分解成多個(gè)3H排樣方式的順序求解。采用遞推過程快速生成排樣方式,通過毛坯初始價(jià)值調(diào)整、排樣方式毛坯價(jià)值修正和代際價(jià)值修正,改變毛坯在排樣過程中的優(yōu)先順序,引導(dǎo)不同種類毛坯在不同排樣方式中均衡分布。多個(gè)系列、大量算例的實(shí)驗(yàn)結(jié)果表明,迭代順序價(jià)值修正算法特別適用于中大規(guī)模的應(yīng)用場(chǎng)合,生成的三階段排樣方案優(yōu)于文獻(xiàn)算法和商業(yè)軟件的同類三階段排樣方案,其效果不僅體現(xiàn)在節(jié)省板材用量和節(jié)省計(jì)算時(shí)間上,而且體現(xiàn)在剪切切割操作的簡(jiǎn)化上。(2)針對(duì)考慮余料標(biāo)準(zhǔn)化的二維剪切下料問題,采用基于束搜索的余料聚集算法,將余料匯集于板材的右側(cè),形成與板材同寬的標(biāo)準(zhǔn)余料。束搜索節(jié)點(diǎn)的評(píng)價(jià)算子包含已填充子板的局部排樣方式價(jià)值、剩余子板的估計(jì)價(jià)值或余料的二次利用價(jià)值,以遞推生成的初始排樣方式作為過濾器刪除部分差節(jié)點(diǎn)。實(shí)驗(yàn)結(jié)果表明,束搜索算法可以快速聚集余料碎片形成大的標(biāo)準(zhǔn)余料,生成的3HL排樣方式在毛坯價(jià)值上比其他啟發(fā)式算法生成的同類排樣方式高。而在相同毛坯價(jià)值下,3HL排樣方式與文獻(xiàn)中的其他剪切排樣方式相比,廢料碎片少,可用標(biāo)準(zhǔn)余料的面積更大,有利于余料的管理和使用。(3)針對(duì)考慮余料標(biāo)準(zhǔn)化的余料下料問題,闡述兩種啟發(fā)式算法:ISVCL算法和ISVC-BS算法。ISVCL算法以材料成本(板材總面積-余料總面積)最少為目標(biāo),在迭代順序價(jià)值修正算法的基礎(chǔ)上增加了標(biāo)準(zhǔn)余料生成和優(yōu)先使用。ISVC-BS算法結(jié)合了迭代順序價(jià)值修正算法和束搜索算法,先通過束搜索算法試排樣部分毛坯,再利用迭代順序價(jià)值修正算法搜索剩余毛坯的板材用量最少排樣方案,并由束搜索算法對(duì)材料利用率低的排樣方式進(jìn)行余料聚集。按最大板長(zhǎng)生成虛擬排樣方式,按性價(jià)比最高的原則選擇排樣方式。通過設(shè)置余料的使用系數(shù),使余料比板材具有更高的使用優(yōu)先權(quán)。單周期的實(shí)驗(yàn)結(jié)果表明,兩種啟發(fā)式算法在生成標(biāo)準(zhǔn)可用余料的同時(shí),排樣方案的板材用量并沒有增加。ISVC-BS算法達(dá)到最少板材用量的迭代次數(shù)比ISVCL算法要少,相同迭代次數(shù)下生成的標(biāo)準(zhǔn)余料更大。多周期的實(shí)驗(yàn)結(jié)果表明,ISVC-BS算法可有效用于余料下料問題,將標(biāo)準(zhǔn)余料用于后繼生產(chǎn)周期,減少板材的用量,降低長(zhǎng)期生產(chǎn)成本。
[Abstract]:Cutting stock problem is a kind of combinatorial optimization problem with high computational complexity. It has a deep engineering application background, such as metal cutting in mechanical manufacturing, wood cutting in furniture industry, glass cutting in construction industry, typesetting in printing industry, plastic processing in chemical industry, cloth cutting in garment industry, etc. In this paper, the two-dimensional shearing blanking problem is studied, starting with the three-stage homogeneous (3H) blanking scheme aiming at minimizing the number of consumed sheets, and extending to the blanking scheme considering the standardization of surplus materials. Finally, the problem of blanking leftovers considering the standardization of leftovers is studied. The minimum amount of leftovers is achieved, and the secondary utilization value and usability of leftovers are improved. The main work and innovations of the two-dimensional shearing blanking problem include: (1) Aiming at the ordinary two-dimensional shearing blanking problem, the iterative sequential value correction algorithm is used to iteratively generate several 3H layout schemes, from which the least amount of sheet metal is selected as the solution of the shearing blanking problem. Through adjusting the initial value of the blank, modifying the value of the blank and intergenerational value of the blank, changing the priority order of the blank in the layout process, guiding the balanced distribution of different kinds of blanks in different layout methods. Positive algorithm is especially suitable for medium and large-scale applications. The generated three-stage layout scheme is superior to the similar three-stage layout scheme of literature algorithm and commercial software. Its effect is not only reflected in saving sheet metal consumption and computing time, but also in the simplification of cutting operation. (2) Two-dimensional layout considering the standardization of residual materials. For the shearing blanking problem, the residue aggregation algorithm based on bundle search is used to aggregate the residue on the right side of the sheet to form the standard residue of the same width as the sheet. The experimental results show that the bundle search algorithm can quickly aggregate the residual fragments to form large standard residues, and the generated 3HL layout method has higher blank value than other heuristic algorithms. However, under the same blank value, the 3HL layout method is compared with other cutting methods in the literature. Compared with the cutting layout method, the scrap fragments are less and the usable area of standard scrap is larger, which is conducive to the management and use of scrap. (3) Aiming at the problem of scrap blanking considering the standardization of scrap, two heuristic algorithms are presented: ISVCL algorithm and ISVC-BS algorithm. ISVC-BS algorithm combines iterative sequential value correction algorithm and bundle search algorithm. First, the bundle search algorithm is used to try out part of the blank layout, and then the iterative sequential value correction algorithm is used to search the least amount of blank layout scheme for the remaining blank. By setting the coefficient of usage of the surplus material, the surplus material has a higher usage priority than the plate material. One-cycle experimental results show that the two heuristic algorithms are in the process of generating the standard. The ISVC-BS algorithm has fewer iterations than ISVCL algorithm, and the standard residue generated under the same iterations is larger. The multi-period experimental results show that ISVC-BS algorithm can be effectively used for the blanking problem of the residue, and the standard residue is used for the subsequent generation. Production cycle, reduce plate consumption, reduce long-term production costs.
【學(xué)位授予單位】：華南理工大學(xué)
【學(xué)位級(jí)別】：博士
【學(xué)位授予年份】：2016
【分類號(hào)】：TB497
本文編號(hào)：2208766
[Abstract]:Cutting stock problem is a kind of combinatorial optimization problem with high computational complexity. It has a deep engineering application background, such as metal cutting in mechanical manufacturing, wood cutting in furniture industry, glass cutting in construction industry, typesetting in printing industry, plastic processing in chemical industry, cloth cutting in garment industry, etc. In this paper, the two-dimensional shearing blanking problem is studied, starting with the three-stage homogeneous (3H) blanking scheme aiming at minimizing the number of consumed sheets, and extending to the blanking scheme considering the standardization of surplus materials. Finally, the problem of blanking leftovers considering the standardization of leftovers is studied. The minimum amount of leftovers is achieved, and the secondary utilization value and usability of leftovers are improved. The main work and innovations of the two-dimensional shearing blanking problem include: (1) Aiming at the ordinary two-dimensional shearing blanking problem, the iterative sequential value correction algorithm is used to iteratively generate several 3H layout schemes, from which the least amount of sheet metal is selected as the solution of the shearing blanking problem. Through adjusting the initial value of the blank, modifying the value of the blank and intergenerational value of the blank, changing the priority order of the blank in the layout process, guiding the balanced distribution of different kinds of blanks in different layout methods. Positive algorithm is especially suitable for medium and large-scale applications. The generated three-stage layout scheme is superior to the similar three-stage layout scheme of literature algorithm and commercial software. Its effect is not only reflected in saving sheet metal consumption and computing time, but also in the simplification of cutting operation. (2) Two-dimensional layout considering the standardization of residual materials. For the shearing blanking problem, the residue aggregation algorithm based on bundle search is used to aggregate the residue on the right side of the sheet to form the standard residue of the same width as the sheet. The experimental results show that the bundle search algorithm can quickly aggregate the residual fragments to form large standard residues, and the generated 3HL layout method has higher blank value than other heuristic algorithms. However, under the same blank value, the 3HL layout method is compared with other cutting methods in the literature. Compared with the cutting layout method, the scrap fragments are less and the usable area of standard scrap is larger, which is conducive to the management and use of scrap. (3) Aiming at the problem of scrap blanking considering the standardization of scrap, two heuristic algorithms are presented: ISVCL algorithm and ISVC-BS algorithm. ISVC-BS algorithm combines iterative sequential value correction algorithm and bundle search algorithm. First, the bundle search algorithm is used to try out part of the blank layout, and then the iterative sequential value correction algorithm is used to search the least amount of blank layout scheme for the remaining blank. By setting the coefficient of usage of the surplus material, the surplus material has a higher usage priority than the plate material. One-cycle experimental results show that the two heuristic algorithms are in the process of generating the standard. The ISVC-BS algorithm has fewer iterations than ISVCL algorithm, and the standard residue generated under the same iterations is larger. The multi-period experimental results show that ISVC-BS algorithm can be effectively used for the blanking problem of the residue, and the standard residue is used for the subsequent generation. Production cycle, reduce plate consumption, reduce long-term production costs.
【學(xué)位授予單位】：華南理工大學(xué)
【學(xué)位級(jí)別】：博士
【學(xué)位授予年份】：2016
【分類號(hào)】：TB497
【相似文獻(xiàn)】
相關(guān)期刊論文 前9條
1 葛玉堂;;剪切和氣割的經(jīng)濟(jì)比較[J];機(jī)械工廠設(shè)計(jì);1958年02期
2 李有堂,郎福元,魏慶同;剪切下料問題的幾何分析[J];甘肅工業(yè)大學(xué)學(xué)報(bào);1992年01期
3 張鵬舉，助飛;精密熱剪切下料生產(chǎn)線[J];軸承;1994年06期
4 ;軸承鋼棒料低溫剪切下料小結(jié)[J];貴州機(jī)械;1979年01期
5 陳永府，張宜生，梁書云;優(yōu)化剪切下料CAPP軟件的開發(fā)[J];機(jī)械與電子;1994年04期
6 傅立壯;棒料的徑向夾緊精密剪切[J];軸承;1995年07期
7 龍東旭;楊興;;2米薄板預(yù)處理線的改造[J];機(jī)械工程師;2011年08期
8 邱純良;錐形攪拌機(jī)軌道圈的氣割裝置[J];建設(shè)機(jī)械技術(shù)與管理;1994年04期
9 ;[J];;年期
相關(guān)博士學(xué)位論文 前1條
1 陳秋蓮;二維剪切下料問題的三階段排樣方案優(yōu)化算法研究[D];華南理工大學(xué);2016年
相關(guān)碩士學(xué)位論文 前1條
1 潘衛(wèi)平;矩形件二維剪切下料排樣算法研究[D];廣西大學(xué);2015年
，本文編號(hào)：2208766
本文鏈接：http://sikaile.net/guanlilunwen/gongchengguanli/2208766.html
最近更新
教材專著
