.png){kind=icon}
返回
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}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
rectangle packing problem
heuristic
greedy algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
1.0W
被引数:
3.8W
机构
暂无机构信息
引用论文
分享收藏The effect of 3-nitropropionic acid on behavioral dysfunction, neuron loss and gliosis in the brain of adult male rats: The case of prefrontal cortex, hippocampus and the cerebellum.png)
Toxicon
ToxiconIF0
PREAI
分享收藏Ley de Subvención Escolar Preferencial (SEP): algunos resultados preliminares de su implementación
PREAI
分享收藏分享收藏
查看更多内容