![Two-stage general block patterns for the two-dimensional cutting problem [An article from: Computers and Operations Research]](https://www.ebooknetworking.net/books/B00/0PD/bigB000PDU37W.jpg)
Two-stage general block patterns for the two-dimensional cutting problem [An article from: Computers and Operations Research]
Book Details
Author(s)Y. Cui, X. Zhang
PublisherElsevier
ISBN / ASINB000PDU37W
ISBN-13978B000PDU378
AvailabilityAvailable for download now
Sales Rank12,903,085
MarketplaceUnited States 🇺🇸
Description
This digital document is a journal article from Computers and Operations Research, published by Elsevier in 2007. The article is delivered in HTML format and is available in your Amazon.com Media Library immediately after purchase. You can view it with any web browser.
Description:
This paper presents an algorithm for the unconstrained two-dimensional cutting problem of rectangular pieces. It proposes the two-stage general block pattern that can be cut into general blocks in two stages, with another two or more stages being required to cut the blocks into pieces. Firstly vertical cuts divide the stock sheet into segments, and then horizontal cuts divide the segments into general blocks. A general block contains general strips, and each cut on the block produces just one strip. The directions of two strips cut successively from a block are either parallel or perpendicular to each other. The algorithm uses a dynamic programming recursion to determine the strip layout on each block, solves knapsack problems to obtain the block layout on each segment and the segment layout on the sheet. The computational results indicate that the algorithm is highly efficient in improving material usage, and the computation time is reasonable.
Description:
This paper presents an algorithm for the unconstrained two-dimensional cutting problem of rectangular pieces. It proposes the two-stage general block pattern that can be cut into general blocks in two stages, with another two or more stages being required to cut the blocks into pieces. Firstly vertical cuts divide the stock sheet into segments, and then horizontal cuts divide the segments into general blocks. A general block contains general strips, and each cut on the block produces just one strip. The directions of two strips cut successively from a block are either parallel or perpendicular to each other. The algorithm uses a dynamic programming recursion to determine the strip layout on each block, solves knapsack problems to obtain the block layout on each segment and the segment layout on the sheet. The computational results indicate that the algorithm is highly efficient in improving material usage, and the computation time is reasonable.
