An algorithm for solving problem of multiple plate single rectangle cutting stockChinese Full Text
Pan Weiping;Chen Qiulian;Cui Yaodong;Li Hua;Computer and Electronic Information College,Guangxi University;
Abstract: An optimal algorithm of generating multiple plate single rectangle part cutting process was put forward.Firstly,the dynamic programming method with the characteristic of full capacity was applied to generate all of the single plate patterns once.Then the integer programming model was established to solve the cutting process,and the number of each kind of plate used was obtained.The optimal goal was to minimize the total area of the plates used under the demand that blanks being satisfied.The experimental results show that,as for the plate number unconstrained problems and constrained problems,the material utilization rate with multiple plate algorithm is improved by 2.09% and 0.83% respectively more than that of single plate cutting algorithm cited in other articles.
Keywords：
nesting; single rectangle part; multiple plate cutting; dynamic programming; integer programming;
- DOI：
10.13330/j.issn.1000-3940.2014.11.002
- Series：
- Subject：
- Classification Code：
O221.4
- Mobile Reading
Read on your phone instantly
Step 1Scan QR Codes
"Mobile CNKI-CNKI Express" App
Step 2Open“CNKI Express”
and click the scan icon in the upper left corner of the homepage.
Step 3
Scan QR Codes
Read this article on your phone.
- HTML
- CAJ Download
- PDF Download
Download the mobile appuse the app to scan this coderead the article.
Tips: Please download CAJViewer to view CAJ format full text.
Download: 623 Page: 6-10 Pagecount: 5 Size: 488K
Citation Network
Related Literature
- Similar Article
- Reader Recommendation
- Associated Author