Why is rectangle packing a search problem

To cope with this difficulty, a new coding scheme, sequence-pair, has been proposed, by means of which any possible packing can be represented. Tabu search is one of the powerful meta-heuristics, which can explore the solution space effectively in an intelligent manner. Thus a tabu search approach for rectangle packing problem based on sequence-pair should be powerful in practical applications, however any such approaches have not been reported.

The purpose of this paper is to apply tabu search to rectangle packing based on sequence-pair, and evaluate this approach. First, rectangle packing problem is formulated, and the representation of each solution is defined.

And then, the proposed method is described in detail, where first admissible move strategy and a concept of stochastic tabu restrictions are employed. The experimental result shows that the proposed method keeps providing good performance through the search process. Already have an account?

This service is more advanced with JavaScript available. Advertisement Hide. Search Strategies for Rectangle Packing. Conference paper. This process is experimental and the keywords may be updated as the learning algorithm improves. This is a preview of subscription content, log in to check access.

Aggoun, A. Beldiceanu, N. In: Walsh [16], pp. In: Perron, L. LNCS, vol. CP Google Scholar. Carlsson, M. Gent, I. A new model based on Artificial Bee Colony algorithm for preventive maintenance with replacement scheduling in continuous production lines. Considering that food always be spoiled in an oven, an analysis of the heat distribution of an object pan in a thermal insulation space has been done. The analysis based on the characteristics of … Expand. Exhaustive approaches to 2D rectangular perfect packings.

View 1 excerpt, references background. View 1 excerpt, references methods. Highly Influential. View 4 excerpts, references methods and background. A new heuristic algorithm for rectangle packing. Exact algorithms for the two-dimensional strip packing problem with and without rotations.