Approximation schemes for covering and packing problems in image processing and VLSI
Journal of the ACM (JACM)
Practical slicing and non-slicing block-packing without simulated annealing
Proceedings of the 14th ACM Great Lakes symposium on VLSI
Exhaustive approaches to 2D rectangular perfect packings
Information Processing Letters
A new heuristic recursive algorithm for the strip rectangular packing problem
Computers and Operations Research
On improved least flexibility first heuristics superior for packing and stock cutting problems
SAGA'05 Proceedings of the Third international conference on StochasticAlgorithms: foundations and applications
| Hi-index | 0.00 |
In this paper, we propose a two-level search algorithm to solve the two-dimensional rectangle packing problem. In our algorithm, the rectangles are placed into the container one by one and each rectangle should be packed at a position by a corner-occupying action so that it touches two items without overlapping other already packed rectangles. At the first level of our algorithm, a simple algorithm called A"0 selects and packs one rectangle according to the highest degree first rule at every iteration of packing. At the second level, A"0 is itself used to evaluate the benefit of a CCOA more globally. Computational results show that the resulted packing algorithm called A"1 produces high-density solutions within short running times.