TOPOS - A new constructive algorithm for nesting problems

OR Spektrum

Volumn 22, Issue 2, 2000, Pages 263-284

  Oliveira, José F ^a,b   Gomes, A Miguel ^a,b   Ferreira, J Soeiro ^a,b  

^a UNIVERSITY OF PORTO   (Portugal)

^b UNIVERSITY OF PORTO   (Portugal)

Author keywords

Constructive heuristics; Cutting and packing; Nesting

Indexed keywords

EID: 0001966464     PISSN: 01716468     EISSN: None     Source Type: Journal    
DOI: 10.1007/s002910050105     Document Type: Article

References (17)

1. Adamowicz M, Albano A (1972) A two-stage solution of the cutting-stock problem. Information Processing 71:1086-1091
2. Adamowicz M, Albano A (1976) A solution of the rectangular cutting-stock problem. IEEE Transactions on Systems, Man and Cybernetics 6:302-310
3. Albano A, Sapuppo G (1980) Optimal allocation of two-dimensional irregular shapes using heuristic search methods. IEEE Transactions on Systems, Man and Cybernetics SMC-10:242-248
4. Art RC (1966) An approach to the two-dimensional, irregular cutting stock problem. Technical Report 36.008, IBM Cambridge Centre
5. Blażewicz J, Hawryluk P, Walkowiak R (1993) Using a tabu search approach for solving the two-dimensional irregular cutting problem. In: Glover F, Laguna M, Taillard E, de Werra D (eds) Tabu Search. Annals of Operations Research 41:313-325
6. Dowsland K, Dowsland W (1992) Packing problems. European Journal of Operational Research 56:2-14
7. Dowsland K, Dowsland W (1995) Solution approaches to irregular nesting problems. European Journal of Operational Research 84:506-521
8. Dowsland KA, Dowsland WB, Bennell JA (1998) Jostling for position: Local improvement for irregular cutting patterns. Journal of the Operational Research Society 49:647-658
9. Dyckhoff H (1990) A typology of cutting and packing problems. European Journal of Operational Research 44:145-159
10. Li Z, Milenkovic V (1993) The complexity of the compaction problem. In: Lubiw A, and Urrutia J (eds) Proceedings of the Fifth Canadian Conference on Computational Geometry, University of Waterloo, Ontario, Canada, pp 7-11
11. Mahadevan A (1984) Optimization in computer-aided pattern packing. PhD thesis, North Carolina State University
12. Milenkovic V, Daniels K (submitted) Translational polygon containment and minimal enclosure using mathematical programming. International Transactions in Operational Research
13. Milenkovic V, Daniels K, Li Z (1991) Automatic marker making. In: Shermer T (ed) Proceedings of the Third Canadian Conference on Computational Geometry. Simon Fraser University, Vancouver, BC, pp 243-246
14. Oliveira JF, Ferreira JS (1993) Algorithms for nesting problems. In: Vidal RVV (ed) Applied simulated annealing, pp 255-273. Springer, Berlin Heidelberg New York
15. Oliveira JF, Ferreira JS (1993) Some experiments with tabu search to solve nesting problems. Paper presented at IFORS'93 Conference, Lisboa, 12-16 July
16. Stoyan Y (1993) Precise and approximate methods of problems in irregular allocation of non-convex polygons in a strip of minimal length. Paper presented at IFORS'93 Conference, Lisboa, 12-16 July
17. Stoyan YG, Yaskov GN (1998) Mathematical model and solution method of optimization problem of placement of rectangles and circles taking into account special constraints. International Transactions in Operational Research 5:45-57