Column-based strip packing using ordered and compliant containment
The oriented strip packing problem is very important to manufacturing industries: given a strip of fixed width and a set of many (> 100) nonconvex polygons with 1, 2, 4, or 8 orientations permitted for each polygon, find a set of translations and orientations for the polygons that places them without overlapping into the strip of minimum length. Heuristics are given for two versions of strip packing: 1) translation-only and 2) oriented. The first heuristic uses an algorithm we have previously developed for translational containment: given polygons P1, P2, ..., Pk and a fixed container C, find translations for the polygons that place them into C without overlapping. The containment algorithm is practical for k ≤10. Two new containment algorithms are presented for use in the second packing heuristic. The first, an ordered containment algorithm, solves containment in time which is only linear in k when the polygons are a) “long” with respect to one dimension of the container and b) ordered with respect to the other dimension. The second algorithm solves compliant containment: given polygons P1, P2, ..., Pl+k and a container C such that polygons P1, P2, ..., Pl are already placed into C, find translations for Pl+1, Pl+2, ..., Pl+k and a nonoverlapping translational motion of P1, P2, ..., Pl that allows all l+k polygons to fit into the container without overlapping.
The performance of the heuristics is compared to the performance of commercial software and/or human experts. The results demonstrate that fast containment algorithms for modest values of k (k ≤10) are very useful in the development of heuristics for oriented strip packing of many (k ≫ 10) polygons.
KeywordsHuman Expert Cloth Utilization Fixed Width Strip Packing Strip Packing Problem
Unable to display preview. Download preview PDF.
- 1.K. Daniels. Containment Algorithms for Nonconvex Polygons with Applications to Layout. PhD thesis, Harvard University, 1995.Google Scholar
- 2.K. Daniels and V. J. Milenkovic. Multiple Translational Containment, Part I: An Approximate Algorithm. Algorithmica, special issue on Computational Geometry in Manufacturing, to appear.Google Scholar
- 3.K. Daniels and V. J. Milenkovic. Multiple Translational Containment: Approximate and Exact Algorithms. In Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 205–214, 1995.Google Scholar
- 4.K. Daniels, V. J. Milenkovic, and Z. Li. Multiple Containment Methods. Technical Report 12-94, Center for Research in Computing Technology, Division of Applied Sciences, Harvard University, 1994.Google Scholar
- 7.L. Guibas, L. Ramshaw, and J. Stolfi. A Kinetic Framework for Computational Geometry. In Proceedings of the 24th IEEE Symposium on Foundations of Computer Science, pages 100–111, 1983.Google Scholar
- 8.O. Gurel. Additional considerations on marker layout problem by graph theory. Technical Report 320-2945, IBM Scientific Centre, 1968.Google Scholar
- 9.O. Gurel. Marker layout via graph theory: An attempt for optimal layout of irregular patterns. Technical Report 320-2921, IBM Scientific Centre, 1968.Google Scholar
- 10.O. Gurel. Circular graph of marker layout. Technical Report 320-2965, IBM Scientific Centre, 1969.Google Scholar
- 11.Z. Li. Compaction Algorithms for Non-Convex Polygons and Their Applications. PhD thesis, Harvard University, Division of Applied Sciences, 1994.Google Scholar
- 12.Z. Li and V. J. Milenkovic. A Compaction Algorithm for Non-Convex Polygons and Its Application. In Proceedings of the 9th Annual ACM Symposium on Computational Geometry, pages 153–162, May 1993.Google Scholar
- 13.V. J. Milenkovic. Multiple Translational Containment, Part II: Exact Algorithms. Algorithmica, special issue on Computational Geometry in Manufacturing, to appear.Google Scholar
- 14.V. J. Milenkovic. A Symmetry Breaking Restriction. Personal communication, March 1995.Google Scholar
- 15.V. J. Milenkovic. Translational Polygon Containment and Minimal Enclosure using Linear Programming Based Restriction. In Proceedings of the 28th Annual ACM Symposium on the Theory of Computing, 1996.Google Scholar
- 16.V. J. Milenkovic and K. Daniels. Translational Polygon Containment and Minimal Enclosure using Geometric Algorithms and Mathematical Programming. Technical Report 25-95, Center for Research in Computing Technology, Division of Applied Sciences, Harvard University, 1995.Google Scholar
- 17.V. J. Milenkovic, K. Daniels, and Z. Li. Placement and Compaction of Nonconvex Polygons for Clothing Manufacture. In Proceedings of the 4th Canadian Conference on Computational Geometry, pages 236–243, 1992.Google Scholar
- 20.J. Serra. Image Analysis and Mathematical Morphology, volume 1. Academic Press, New York, 1982.Google Scholar
- 21.J. Serra, editor. Image Analysis and Mathematical Morphology, volume 2: Theoretical Advances. Academic Press, New York, 1988.Google Scholar
- 22.P. E. Sweeney and E. R. Paternoster. Cutting and Packing Problems: A Categorized, Application-Oriented Research Bibliography. Journal of the Operational Research Society, 43(7):691–706, 1992.Google Scholar