.png){kind=icon}
返回
Sequential heuristic for the two-dimensional bin-packing problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2014.06.032.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A heuristic approach for the two-dimensional bin-packing problem is proposed. The algorithm is based on the sequential heuristic procedure that generates each pattern to produce some items and repeats until all items are produced. Both guillotine and non-guillotine patterns can be used. Each pattern is obtained from calling a pattern-generation procedure, where the objective is to maximize the pattern value. The item values are adjusted after the generation of each pattern using a value correction formula. The algorithm is compared with five published algorithms, using 50 groups of benchmark instances. The results indicate that the algorithm is the most efficient in improving solution quality. (C) 2014 Elsevier B.V. All rights reserved.
Keyword:
Packing
2D bin-packing
Sequential value correction
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
.png){kind=icon}
Detection of early myocardial cell death in owl monkeys (Aotus nancymai) using complement component C9 immunohistochemistry in formalin‐fixed paraffin‐embedded heart tissues: A retrospective study使用补体成分C9免疫组化检测夜猴(Aotus nancymai)早期心肌细胞死亡：一项回顾性研究（在甲醛固定石蜡包埋的心脏组织中）。
OAAI
OAAI分享收藏Construction heuristics for two-dimensional irregular shape bin packing with guillotine constraints
OAAI
OAAI分享收藏
查看更多内容