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. © 2010 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
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 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5991 LNAI, pp. 225–236). https://doi.org/10.1007/978-3-642-12101-2_24
Mendeley helps you to discover research relevant for your work.