.png){kind=icon}
.png){kind=icon}
Return
A two-level search algorithm for 2D rectangular packing problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2007.04.007.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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(l) produces high-density solutions within short running times. (c) 2007 Elsevier Ltd. All rights reserved.
Keywords:
rectangle packing problem
heuristic
greedy algorithm
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.5
Papers:
1.0W
Citations:
3.8W
Organization
No organization information available