Abstract
Nesting algorithms deal with the optimal placement of shapes in specified regions subject to specified constraints. In this paper, a complex algorithm for solving two-dimensional nesting problem is proposed. Arbitrary geometric shapes are first quantized into a binary form. These binary representations are subsequently processed by operators which nest the shapes in a rectangle of minimum area. After nesting is completed, the binary representations are converted back to the original geometric form. Investigations have shown that the nesting effect is driven by quantization accuracy. Therefore, better accuracy is possible given more computing time. However, the proposed knowledge based system can significantly reduce the time of nesting, by intelligently pairing shapes, based on prior knowledge of their form.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bogalinski, P., Pozniak-Koszalka, I., Koszalka, L., Kasprzak, A.: Algorithms to Solving Strip Nesting Problem based on Tabu Search and ACO. In: Proceedings to 23rd IAR Conference on Advanced Control and Diagnosis, Coventry, November 2008, pp. 240–245 (2008)
Chmaj, G., Koszalka, L.: Quantization Applied to 2D Shape Arrangement Problem. Acta MOSIS 112, Ostrava (2006)
Oliviera, F.C., Ferreira, J.A.S.: Algorithms for Nesting Problems. In: Vidal, R. (ed.). LNEMS, vol. 396, pp. 256–273. Springer, Heidelberg (1993)
Nielsen, B., Odgaard, A.: Fast Neighbourhood Search for the Nesting Problem. Research Report by the University of Copenhagen (2003)
Burke, E., Kendall, G.: Applying Ant Algorithms and the No Fit Polygon to the Nesting Problem. Scientific Report of the University of Nottingham (2002)
Albano, A., Sappupo, G.: Optimal Allocation of Two Dimensional Shapes using Heuristic Search Methods. IEEE Trans. on Systems, Man and Cybernetics, SMC-10, 242–248 (2001)
Oliveira, J., Ferreira, J.: Algorithms for Nesting. Applied Simulated Annealing (1993)
Rintala, T.A.: Genetic Approach to a Nesting Problem. In: Proceedings to the 2nd Nordic Workshop on Genetic Algorithms and their Applications (1996)
Gomes, A., Oliveira, J.: GRASP Approach to Nesting Algorithm. University of Porto (2001)
Koszalka, L., Kubiak, M., Pozniak-Koszalka, I.: Comparison of SBA – Family Task Allocation Algorithms for Mesh Structured Networks. In: Min, G., Di Martino, B., Yang, L.T., Guo, M., Rünger, G. (eds.) ISPA Workshops 2006. LNCS, vol. 4331, pp. 21–30. Springer, Heidelberg (2006)
Koszalka, L., Lisowski, D., Pozniak-Koszalka, I.: Comparison of Allocation Algorithms for Mesh Networks with Multistage Experiments. In: Gavrilova, M.L., Gervasi, O., Kumar, V., Tan, C.J.K., Taniar, D., Laganá, A., Mun, Y., Choo, H. (eds.) ICCSA 2006. LNCS, vol. 3984, pp. 58–67. Springer, Heidelberg (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chmaj, G., Pozniak-Koszalka, I., Kasprzak, A. (2009). A Knowledge Based System for Minimum Rectangle Nesting. In: Velásquez, J.D., RÃos, S.A., Howlett, R.J., Jain, L.C. (eds) Knowledge-Based and Intelligent Information and Engineering Systems. KES 2009. Lecture Notes in Computer Science(), vol 5711. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04595-0_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-04595-0_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04594-3
Online ISBN: 978-3-642-04595-0
eBook Packages: Computer ScienceComputer Science (R0)