.png){kind=icon}
返回
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}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
rectangle-packing
heuristic algorithm
corner-occupying action
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.6
论文数:
2.6K
被引数:
4.8K
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏
查看更多内容