.png){kind=icon}
返回
A quasi-human algorithm for solving the three-dimensional rectangular packing problem
.png){kind=icon}
PRE
AI
DOI：10.1007/s11432-010-4112-8.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Based on the concept of maximal rectangular space that can be filled at current time and the siege warfare tactics, we make several critical improvements on the quasi-human caving-degree approach to get a stronger algorithm ICDA for a classical NP hard problem: the three-dimensional rectangular packing problem. Within similar computing time, the new algorithm gained an average volume utilization of 90.92% on the natural and difficult 100 benchmarks, called BR15, where items to be packed are almost different in size. Compared with current best record just reported in the literature in 2010, our result makes an improvement by 0.54%.
Keyword:
NP hard
three-dimensional packing
quasi-human
action space
caving degree
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.6
论文数:
4.9K
被引数:
8.9K
机构
暂无机构信息
引用论文
.png){kind=icon}
没有更多内容
没有更多内容