(Lecture Notes in Computer Science, 2005-01-01) Pedro Salinas, José Manuel de; Delgado Pineda, Miguel; Aranda Almansa, Joaquín
This article shows some techniques based on simulated annealing and genetic alghoritms for the resolution of a filling problem of a container of two dimensions using rectangular pieces of sizes not congruent. This problem is quite related to problems like bin-packing or strip-packing. The comparative was made using several type problems and having into account parameters like run time, number of solutions that converge to the optimum one and quality of the found non-optimum solutions.
