Computing closely matching upper and lower bounds on textile nesting problems

European Journal of Operational Research

Volumn 108, Issue 3, 1998, Pages 473-489

  Heckmann, Ralf ^a   Lengauer, Thomas ^a,b  

^a FRAUNHOFER INSTITUTE FOR APPLIED INFORMATION TECHNOLOGY FIT   (Germany)

^b UNIVERSITY OF BONN   (Germany)

Author keywords

Cutting; Lower bounds; Nesting; Packing; Upper bounds

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; CALCULATIONS; CUTTING; OPTIMIZATION; PROBLEM SOLVING; SIMULATED ANNEALING; TEXTILE PROCESSING; TEXTILES;

BRANCH AND BOUND METHOD; GLOBAL OPTIMIZATION; HODOGRAPH; NESTING; POLYGONAL APPROXIMATION; STENCIL;

OPERATIONS RESEARCH;

EID: 0032143295     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(97)00049-0     Document Type: Article

References (31)

1. M. Adamowicz, A. Albano, Nesting two-dimensional shapes in rectangular modules, Computer Aided Design 8 (1) (1976) 27-33.
2. A. Albano, G. Sapuppo, Optimal allocation of two-dimensional irregular shapes using heuristic search methods, IEEE Transactions on Systems, Man, and Cybernetics 10 (5) (1980) 242-248.
3. C. Amaral, J. Bernardo, J. Jorge, Marker-making using automatic placement of irregular shapes for the garment industry, Computer & Graphics 14 (1) (1990) 41-46.
4. M. Ben-Bassat, D. Dori, Efficient nesting of congruent convex figures, Communications of the ACM 27 (3) (1984) 228-235.
5. C. Bounsaythip, S. Maouche, G. Roussel, Algorithms for a marker making system: ∈-admissible resolution, 12th International Conference on Systems Science, Wroclaw, Poland, 1995.
6. J. Chung, D.J. Hillman, D. Scott, An intelligent nesting system on 2-D highly irregular resources, in: Applications of Artificial Intelligence VIII - Proceedings of the 8th International Conference of the International Society for Optical Engineering (SPIE), vol. 1293, 1990, pp. 472-483.
7. R. Cuninghame-Green, Geometry, shoemaking and the milk tray problem, New Scientist 12 (1989) 50-53.
8. R. Cuninghame-Green, Cut out waste!, OR Insight 5 (3) (1992) 4-7.
9. C.H. Daǧli, M. Tatoǧlu, An approach to two-dimensional cutting stock problems, International Journal of Production Research 25 (2) (1987) 175-190.
10. K. Daniels, Z. Li, V. Milenkovic, Automatic marker making, in: T. Shermer (Ed.), Proceedings of the Third Canadian Conference on Computational Geometry, August 1991.
11. K. Daniels, Z. Li, V. Milenkovic, Placement and compaction of non-convex polygons for clothing manufacture, in: C. Wang (Ed.), Proceedings of the Fourth Canadian Conference on Computational Geometry, August 1992.
12. K. Daniels, V. Milenkovic, Multiple translational containment: Approximate and exact algorithms, in: Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, 1995, pp. 205-214.
13. K. Daniels, V. Milenkovic, Translational polygon containment and minimal enclosure using geometric algorithms and mathematical programming, 36th Annual IEEE Conference on Foundations of Computer Science, 1995.
14. K.A. Dowsland, Some experiments with simulated annealing techniques for packing problems, European Journal of Operational Research 68 (1993) 389-399.
15. K.A. Dowsland, W.B. Dowsland, Packing problems, European Journal of Operational Research 56 (1) (1992) 2-14.
16. K.A. Dowsland, W.B. Dowsland, Solution approaches to irregular nesting problems, European Journal of Operational Research 84 (3) (1995) 506-521.
17. H. Dyckhoff, U. Finke, Cutting and Packing in Production and Distribution, Physica-Verlag, Heidelberg, 1992.
18. J.S. Ferreira, J.F. Oliveira, An application of simulated annealing to the nesting problem, in: ORSA/TIMS Bulletin Number 34 (Program of the 34th Joint National Meeting, San Francisco, CA), November 1992.
19. J.S. Ferreira, J.F. Oliveira, Algorithms for nesting problems, in: R.V. Vidal (Ed.), Applied Simulated Annealing, Springer-Verlag, Berlin, 1993, pp. 255-273.
20. R.J. Fowler, M.S. Paterson, S.L. Tanimoto, Optimal packing and covering in the plane are NP-complete, Information Processing Letters 12 (3) (1981) 133-137.
21. L. Guibas, L. Ramshaw, J. Stolfi, A kinetic framework for computational geometry, in: IEEE Annual Symposium on Foundations of Computer Science, vol. 24, 1983, pp. 100-111.
22. R. Heckmann, T. Lengauer, A simulated annealing approach to the nesting problem in the textile manufacturing industry, Annals of Operations Research 57 (1995) 103-133.
23. J. Heistermann, T. Lengauer, Efficient automatic part nesting on irregular and inhomogeneous surfaces, in: Proceedings of the Fourth ACM-SIAM Symposium on Discrete Algorithms (SODA'93), Austin, TX, January 1993, pp. 251-259.
24. J. Heistermann, T. Lengauer, The nesting problem in the leather manufacturing industry, Annals of Operations Research 57 (1995) 147-173.
25. A. Kaul, M. O'Connor, V. Srinivasan, Computing Minkowski sums of regular polygons, in: Proceedings of the 3rd Canadian Conference on Computational Geometry, Vancouver, BC, 1991.
26. Z. Li, V. Milenkovic, A compaction algorithm for non-convex polygons and its application, in: Proceedings of the Ninth Annual ACM Symposium on Computational Geometry, May 1993.
27. S. Maouche, G. Roussel, Intelligent lay-planning system for irregular shapes and sheet with patterns and flaws: resolution by ∈-admissible tree search, 24th International Symposium on Industrial Robots (ISIR), Tokyo, 1993.
28. C.E. Pfefferkorn, A heuristic problem solving design system for equipment or furniture layouts, Communications of the ACM 18 (5) (1975) 286-297.
29. W. Qu, J.L. Sanders, A nesting algorithm for irregular parts and parts affecting trim loss, International Journal of Production Research 25 (3) (1987) 381-397.
30. E. Ridenour Paternoster, P. E. Sweeney, Cutting and packing problems: a categorized application-orientated research bibliography, Journal of the Operational Research Society 43 (7) (1992) 691-706.
31. S. Roberts, Application of heuristic techniques to the cutting-stock problem for worktops, Journal of the Operational Research Society 35 (5) (1984) 369-377.