Abstract
The paper concerns the strip nesting problem. This kind of problems is NP-hard even fort rectangular shapes and plate with no rotation allowed. In this paper computer system for making efficiency comparison of heuristic algorithms is proposed. The evaluation of tabu search, ACO and simulated annealing algorithms with raster approach to the geometry of problem is described. The evaluation was made on the basis of the results of simulations made using the experimentation system designed and implemented by authors.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bennell, J.A., Oliveira, J.F.: The geometry of nesting problems: A tutorial. European Journal of Operational Research 184(2), 397–415 (2008)
Blazewicz, J., Hawryluk, P., Walkowiak, R.: Using a tabu search approach for solving the two-dimensional irregular cutting problem. Ann. Oper. Res. 41(1-4), 313–325 (1993)
Bogalinski, P., Pozniak-Koszalka, I., Koszalka, L., Kasprzak, A.: Algorithms to Solving Strip Nesting Problem based on Tabu Search and ACO. In: Proc. to 23rd IAR Conf., pp. 240–245 (2008)
Budzynska, L., Kominek, P.: The application of GLS algorithm to 2 dimension irregular-shape cutting problem. In: Bubak, M., van Albada, G.D., Sloot, P.M.A., Dongarra, J. (eds.) ICCS 2004. LNCS, vol. 3038, pp. 1241–1248. Springer, Heidelberg (2004)
Chmaj, G., Koszalka, L.: Quantization Applied to 2D Shape Arrangement. Acta Mosis 112 (2006)
Kendall, G., Burke, E.: Applying evolutionary algorithms and the no fit polygon to the nesting problem. In: IC-AI 1999: The 1999 International Conference on Artificial Intelligence (1999)
Kendall, G., Burke, E.: Applying ant algorithms and the no fit polygon to the nesting problem. In: Foo, N.Y. (ed.) AI 1999. LNCS, vol. 1747. Springer, Heidelberg (1999)
Egeblad, J., Nielsen, B.K., Odgaard, A.: Fast neighbourhood search for two-and three-dimensional nesting problems. European Journal of Operational Research 183(3), 1249–1266 (2007)
Oliveira, J.F., Ferreira, J.S.: Algorithms for nesting problems. In: Applied Simulated Annealing. LNEMS, pp. 255–273 (1993)
Ohia, D., Koszalka, L., Kasprzak, A.: Evolutionary Algorithm for Solving Congestion Problem in Computer Networks. In: Velásquez, J.D., Ríos, S.A., Howlett, R.J., Jain, L.C. (eds.) Knowledge-Based and Intelligent Information and Engineering Systems. LNCS (LNAI), vol. 5711, pp. 112–121. Springer, Heidelberg (2009)
Rintala, T.A.: Genetic Approach to a Nesting Problem. In: Proceedings to the 2nd Nordic Workshop on Genetic Algorithms and their Applications (1996)
Chmaj, G., Pozniak-Koszalka, I., Kasprzak, A.: A knowledge based system for minimum rectangle nesting. In: Velásquez, J.D., Ríos, S.A., Howlett, R.J., Jain, L.C. (eds.) KES 2009, Part I. LNCS, vol. 5711, pp. 104–112. Springer, Heidelberg (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bogalinski, P., Koszalka, L., Pozniak-Koszalka, I., Kasprzak, A. (2010). Computer System for Making Efficiency Analysis of Meta-heuristic Algorithms to Solving Nesting Problem. In: Nguyen, N.T., Le, M.T., Świątek, J. (eds) Intelligent Information and Database Systems. ACIIDS 2010. Lecture Notes in Computer Science(), vol 5991. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12101-2_24
Download citation
DOI: https://doi.org/10.1007/978-3-642-12101-2_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-12100-5
Online ISBN: 978-3-642-12101-2
eBook Packages: Computer ScienceComputer Science (R0)