Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
9663643 | European Journal of Operational Research | 2005 | 20 Pages |
Abstract
The rectangle packing problem with general spatial costs is to pack given rectangles without overlap in the plane so that the maximum cost of the rectangles is minimized. This problem is very general, and various types of packing problems and scheduling problems can be formulated in this form. For this problem, we have previously presented local search algorithms using a pair of permutations of rectangles to represent a solution. In this paper, we propose speed-up techniques to evaluate solutions in various neighborhoods. Computational results for the rectangle packing problem and a real-world scheduling problem exhibit good prospects of the proposed techniques.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
S. Imahori, M. Yagiura, T. Ibaraki,