Heuristic approaches to large-scale periodic packing of irregular shapes on a rectangular sheet
The nesting problem is a two-dimensional cutting and packing problem where the small pieces to cut have irregular shapes. A particular case of the nesting problem occurs when congruent copies of one single shape have to fill, as much as possible, a limited sheet. Traditional approaches to the nesting problem have difficulty to tackle with high number of pieces to place. Additionally, if the orientation of the given shape is not a constraint, the general nesting approaches are not particularly successful. This problem arises in practice in several industrial contexts such as footwear, metalware and furniture. A possible approach is the periodic placement of the shapes, in a lattice way. In this paper, we propose three heuristic approaches to solve this particular case of nesting problems. Experimental results are compared with published results in literature and additional results obtained from new instances are also provided.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Stoyan, Yu G. & Patsuk, V. N., 2000. "A method of optimal lattice packing of congruent oriented polygons in the plane," European Journal of Operational Research, Elsevier, vol. 124(1), pages 204-216, July.
- Stoyan, Yu. G. & Pankratov, A. V., 1999. "Regular packing of congruent polygons on the rectangular sheet," European Journal of Operational Research, Elsevier, vol. 113(3), pages 653-675, March.
- Gomes, A. Miguel & Oliveira, Jose F., 2002. "A 2-exchange heuristic for nesting problems," European Journal of Operational Research, Elsevier, vol. 141(2), pages 359-370, September.
- Wascher, Gerhard & Hau[ss]ner, Heike & Schumann, Holger, 2007. "An improved typology of cutting and packing problems," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1109-1130, December.
- Dowsland, Kathryn A. & Dowsland, William B., 1992. "Packing problems," European Journal of Operational Research, Elsevier, vol. 56(1), pages 2-14, January.
When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:192:y:2009:i:1:p:29-40. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei)
If references are entirely missing, you can add them using this form.