.png){kind=icon}
Return
An efficient heuristic algorithm for rectangle-packing problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.simpat.2007.09.004.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Rectangle-packing problem involves many industrial applications, such as shipping, timber cutting, very large scale integration (VLSI) floor planning, and so on. This problem has shown to be NP hard, and many algorithms such as genetic algorithm, simulated annealing and other heuristic algorithms are presented to solve it. Based on the wisdom and experience of human being, an efficient heuristic algorithm is proposed in this paper. Two group benchmarks arc used to test the performance of the produced algorithm, 19 instances of first group and 3 instances of second group having achieved optimal solutions. The experimental results demonstrate that the presented algorithm is rather efficient for solving the rectangle-packing problem. (c) 2007 Elsevier B.V. All rights reserved.
Keywords:
rectangle-packing
heuristic algorithm
corner-occupying action
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.6
Papers:
2.6K
Citations:
4.8K
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSave
View more