A rectangle packing is a non-overlapping placement of given rectangles. The algorithm to optimize the rectangle packing can be required in a variety of application fields. However, since the optimization problem of rectangle packing is a combinatorial optimization problem and NP-hard, it is hard to solve it exactly in practical applications. 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.
抄録全体を表示