A quasi-human algorithm for solving the three-dimensional rectangular packing problem

作     者：HE Kun & HUANG WenQi School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan 430074, China 

作者机构：School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China 

出 版 物：《Science China(Information Sciences)》 (中国科学:信息科学(英文版))

年 卷 期：2010年第53卷第12期

页      面：2389-2398页

核心收录：

学科分类：08[工学] 081202[工学-计算机软件与理论] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：supported by the National Natural Science Foundation of China (Grant No. 60773194) 

主　　题：NP hard three-dimensional packing quasi-human action space caving degree 

摘      要：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%.