.png){kind=icon}
返回
A simple randomized algorithm for two-dimensional strip packing
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2012.05.001.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Two-dimensional strip packing problem is to pack given rectangular pieces on a strip of stock sheet having fixed width and infinite height. Its aim is to minimize the height of the strip such that non-guillotinable and fix orientation constraints are meet. In this paper, an improved scoring rule is developed and the least waste priority strategy is introduced, and a randomized algorithm is presented for solving this problem. This algorithm is very simple and does not need to set any parameters. Computational results on a wide range of benchmark problem instances show that the proposed algorithm obtains a better or matching performance as compared to the most of the previously published meta-heuristics. (C) 2012 Elsevier Ltd. All rights reserved.
Keyword:
Packing problem
Heuristic
Randomized algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
.png){kind=icon}
On the Impact of Formative Assessment on Student Motivation, Achievement, and Conceptual Change
PREAI
分享收藏
查看更多内容