Computing upper and lower bounds on textile nesting problems
 Ralf Heckmann,
 Thomas Lengauer
 … show all 2 hide
Abstract
We consider an industrial cutting problem in textile manufacturing and report on heuristics for computing cutting images and lower bounds on waste for this problem. For the upper bounds we use greedy strategies based on hodographs and global optimization based on simulated annealing. For the lower bounds we use branchandbound methods for computing optimal solutions of placement subproblems that determine the performance of the overall subproblem. The upper bounds are computed in less than an hour on a commonday workstation and are competitive in quality with results obtained by human nesters. The lower bounds take a few hours to compute and are within 0.4% of the upper bound for certain types of clothing (e.g., for pants).
 Amaral, C., Bernardo, J., Jorge, J. (1990) Markermaking using automatic placement of irregular shapes for the garment industry. Computer & Graphics 14: pp. 4146
 C. Bounsaythip, S. Maouche, and G. Roussel. “Algorithms for a marker making system: εadmissible resolution”. 12th International Conference on Systems Science, Wroclaw (Poland), 1995.
 Chung, J., Hillman, D. J., Scott, D. (1990) An intelligent nesting system on 2D highly irregular resources. Applications of Artificial Intelligence VIII — Proceedings of the 8th International Conference of the International Society for Optical Engineering (SPIE) 1293: pp. 472483
 CuninghameGreen, R. (1989) Geometry, shoemaking and the milk tray problem. New Scientist No. 12: pp. 5053
 CuninghameGreen, R. (1992) Cut out waste!. OR Insight 5: pp. 47
 K. Daniels, Z. Li, and V. Milenkovic. “Automatic marker making”. In T. Shermer, editor, Proceedings of the Third Canadian Conference on Computational Geometry, August 1991.
 K. Daniels, Z. Li, and V. Milenkovic. “Placement and compaction of nonconvex polygons for clothing manufacture”. In C. Wang, editor, Proceedings of the Fourth Canadian Conference on Computational Geometry, August 1992.
 K. Daniels and V. Milenkovic. “Multiple translational containment: Approximate and exact algorithms”. Proceedings of the 6th Annual ACMSIAM Symposium on Discrete Algorithms, pages 205–214, 1995.
 K. Daniels and V. Milenkovic. “Translational polygon containment and minimal enclosure using geometric algorithms and mathematical programming”. 36th Annual IEEE Conference on Foundations of Computer Science, 1995.
 Dowsland, K. A., Dowsland, W. B. (1992) Packing problems. European Journal of Operational Research (EJOR) 56: pp. 214
 Dowsland, K. A., Dowsland, W. B. (1994) Solution approaches to irregular nesting problems. Working paper EBMS/1994/18. European Business Management School, University of Wales, Swansea, Singleton Park, Swansea SA2 8PP, UK
 Dyckhoff, H., Finke, U. (1992) Cutting and Packing in Production and Distribution. PhysicaVerlag, Heidelberg, Germany
 Fowler, R. J., Paterson, M. S., Tanimoto, S. L. (1981) Optimal packing and covering in the plane are NPcomplete. Information Processing Letters (IPL) 12: pp. 133137
 Heckmann, R., Lengauer, T. A simulated annealing approach to the nesting problem in the textile manufacturing industry. In: Burkard, R. E., Hammer, P. L., Ibaraki, T., Queyranne, M. eds. (1995) Annals of Operations Research, volume No. 57. J.C. Baltzer AG Science Publishers, Amsterdam, pp. 103133
 J. Heistermann and T. Lengauer. “Efficient automatic part nesting on irregular and inhomogeneous surfaces”. In Proceedings of the Fourth ACMSIAM Symposium on Discrete Algorithms (SODA '93), pages 251–259, Austin, Texas, USA, January 1993.
 Heistermann, J., Lengauer, T. The nesting problem in the leather manufacturing industry. In: Burkard, R. E., Hammer, P. L., Ibaraki, T., Queyranne, M. eds. (1995) Annals of Operations Research, volume No. 57. J.C. Baltzer AG Science Publishers, Amsterdam, pp. 147173
 Z. Li and V. Milenkovic. “A compaction algorithm for nonconvex polygons and its application”. In Proceedings of the Ninth Annual ACM Symposium on Computational Geometry, May 1993.
 S. Maouche and G. Roussel. “Intelligent layplanning system for irregular shapes and sheet with patterns and flaws. resolution by εadmissible tree search”. 24th International Symposium on Industrial Robots (ISIR), Tokyo, 1993.
 Milenkovic, V. (1994) Multiple translational containment, Part II: Exact algorithms. Extended abstract. Aiken Computation Laboratory, Harvard University, Cambridge, MA 02138
 Pfefferkorn, C. E. (1975) A heuristic problem solving design system for equipment or furniture layouts. Communications of the ACM 18: pp. 286297
 Paternoster, E. R., Sweeney, P. E. (1992) Cutting and packing problems: A categorized applicationorientated research bibliography. Journal of the Operational Research Society 43: pp. 691706
 Roberts, S. (1984) Application of heuristic techniques to the cuttingstock problem for worktops. Journal of the Operational Research Society 35: pp. 369377
 Title
 Computing upper and lower bounds on textile nesting problems
 Book Title
 Algorithms — ESA '96
 Book Subtitle
 Fourth Annual European Symposium Barcelona, Spain, September 25–27, 1996 Proceedings
 Pages
 pp 392405
 Copyright
 1996
 DOI
 10.1007/3540616802_70
 Print ISBN
 9783540616801
 Online ISBN
 9783540706670
 Series Title
 Lecture Notes in Computer Science
 Series Volume
 1136
 Series ISSN
 03029743
 Publisher
 Springer Berlin Heidelberg
 Copyright Holder
 SpringerVerlag
 Additional Links
 Topics
 Industry Sectors
 eBook Packages
 Editors
 Authors

 Ralf Heckmann ^{(1)}
 Thomas Lengauer ^{(1)} ^{(2)}
 Author Affiliations

 1. Institute for Algorithms and Scientific Computing, German National Research Center for Information Technology (GMD), Schloß Birlinghoven, 53754, Sankt Augustin, Germany
 2. Department of Computer Science, University of Bonn, Römerstraße 164, 53117, Bonn, Germany
Continue reading...
To view the rest of this content please follow the download PDF link above.