單一尺寸矩形件下料問(wèn)題的一種精確算法
發(fā)布時(shí)間:2018-12-06 21:15
【摘要】:針對(duì)機(jī)械制造業(yè)領(lǐng)域的單一尺寸矩形件下料問(wèn)題,提出一種基于整數(shù)規(guī)劃和約束規(guī)劃的精確下料算法。首先在板材上刻畫W+1條等距的水平基線;然后建立下料問(wèn)題的整數(shù)規(guī)劃數(shù)學(xué)模型,求解出最優(yōu)下料方案所對(duì)應(yīng)的每條基線上排放的水平矩形件和豎直矩形件個(gè)數(shù);最后采用約束規(guī)劃模型求解出每個(gè)矩形件在基線上的具體排放坐標(biāo),畫出最優(yōu)下料方案圖。將這里算法與文獻(xiàn)中單一尺寸矩形件下料算法進(jìn)行比較,數(shù)值實(shí)驗(yàn)結(jié)果表明,這里算法求得的下料方案板材利用率更高。
[Abstract]:An accurate blanking algorithm based on integer programming and constraint programming is proposed to solve the single size rectangular part blanking problem in the field of mechanical manufacturing. Firstly, we describe the horizontal baselines of W1 equidistant on the sheet metal, and then establish the integer programming mathematical model of the blanking problem, and solve the number of horizontal and vertical rectangular parts discharged on each baseline corresponding to the optimal blanking scheme. Finally, the constraint programming model is used to solve the specific emission coordinates of each rectangular component on the baseline, and the optimal cutting plan is drawn. Compared with the single size rectangular part blanking algorithm in literature, the numerical results show that the plate utilization ratio of this algorithm is higher than that of the single size rectangular part.
【作者單位】: 鄭州科技學(xué)院信息工程學(xué)院;南寧學(xué)院信息工程學(xué)院;
【基金】:廣西科學(xué)研究與技術(shù)開(kāi)發(fā)計(jì)劃(桂科攻11107006-13,桂科攻12118017-10A)
【分類號(hào)】:O221;TG48
本文編號(hào):2366670
[Abstract]:An accurate blanking algorithm based on integer programming and constraint programming is proposed to solve the single size rectangular part blanking problem in the field of mechanical manufacturing. Firstly, we describe the horizontal baselines of W1 equidistant on the sheet metal, and then establish the integer programming mathematical model of the blanking problem, and solve the number of horizontal and vertical rectangular parts discharged on each baseline corresponding to the optimal blanking scheme. Finally, the constraint programming model is used to solve the specific emission coordinates of each rectangular component on the baseline, and the optimal cutting plan is drawn. Compared with the single size rectangular part blanking algorithm in literature, the numerical results show that the plate utilization ratio of this algorithm is higher than that of the single size rectangular part.
【作者單位】: 鄭州科技學(xué)院信息工程學(xué)院;南寧學(xué)院信息工程學(xué)院;
【基金】:廣西科學(xué)研究與技術(shù)開(kāi)發(fā)計(jì)劃(桂科攻11107006-13,桂科攻12118017-10A)
【分類號(hào)】:O221;TG48
【相似文獻(xiàn)】
相關(guān)期刊論文 前5條
1 趙暉,席平;矩形件優(yōu)化排樣算法與系統(tǒng)的研究[J];鍛壓技術(shù);2005年01期
2 李勇,曹炬,梅晚霞;矩形件排樣的一種優(yōu)化算法[J];機(jī)械設(shè)計(jì)與制造;2005年01期
3 王菲,羅意平,楊岳,張曉峰;定序列矩形件優(yōu)化排樣新算法[J];工程圖學(xué)學(xué)報(bào);2005年04期
4 李勇,曹炬,梅晚霞,方仍存;矩形件排樣優(yōu)化的十字線法[J];鍛壓裝備與制造技術(shù);2004年06期
5 韓喜君;丁根宏;;矩形件優(yōu)化排樣問(wèn)題的混合遺傳算法求解[J];計(jì)算機(jī)技術(shù)與發(fā)展;2006年06期
相關(guān)碩士學(xué)位論文 前1條
1 韓喜君;基于統(tǒng)計(jì)分析的矩形件排樣問(wèn)題遺傳算法研究[D];河海大學(xué);2006年
,本文編號(hào):2366670
本文鏈接:http://sikaile.net/kejilunwen/yysx/2366670.html
最近更新
教材專著