Abstract
In this paper we formulate the two-stage stock-cutting problem according to which a set of rectangular pieces of prespecified dimensions are to be cut from a general shape object with general shape holes or defective regions. We show how mathematical morphological operators can be used in order to determine the optimal shifting for a given cutting pattern. The technique of the simulated annealing is used for determining the cutting pattern. Experimental results are also included.
Preview
Unable to display preview. Download preview PDF.
References
Beasley, J. E.: An exact two-dimensional non-guillotine cutting tree search procedure. Operations Research, 33(1), January–February 1985, pp. 49–64.
Christofides, N. and Whitlock, C.: An algorithm for two-dimensional cutting problems. Operations Research, 25(1), January–February 1977, pp. 30–44.
Georgis, N., Petrou, M. and Kittler, J.: A new algorithm for the constrained rectangle packing problem, in ICARCV92, volume 2, 16–18 September 1992, pp. IA–4.1.1.
Gilmore, P. C. and Gomory, R. E.: Multistage cutting problems of two and more dimensions. Operations Research, 13, 1965, pp. 94–120.
Haralick, R. M. and Shapiro, L. G.: Computer and Robot Vision. volume I, Addison-Wesley, 1992.
Kirkpatrick, S., Gelatt, C. D. and Vecchi, M. P.: Optimisation by simulated annealing. Science, 220(4598), May 1983, pp. 671–680.
Wang, P. Y.: Two algorithms for constrained two-dimensional cutting stock problems. Operations Research, 31(3), May–June 1983, pp. 573–586.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Georgis, N., Petrou, M., Kittler, J. (1993). A morphological approach to the generalised 2-stage stock-cutting problem. In: Chetverikov, D., Kropatsch, W.G. (eds) Computer Analysis of Images and Patterns. CAIP 1993. Lecture Notes in Computer Science, vol 719. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57233-3_41
Download citation
DOI: https://doi.org/10.1007/3-540-57233-3_41
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57233-6
Online ISBN: 978-3-540-47980-2
eBook Packages: Springer Book Archive