A pure quasi-human algorithm for solving the cuboid packing problem

查看全文 作　　者：HUANG WenQi HE [1]Kun

机构地区：[1]College of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan 430074, China

出　　处：《Science in China(Series F)》索引2009年第52卷第1期,共7页

基　　金：Supported by the National Natural Science Foundation of China (Grant No. 60773194);the National Basic Research Program of China (GrantNo. 2004CB318000);Postdoctoral Science Foundation of China (Grant No. 20070420174) 摘　　要：We excavate the wisdom from an old Chinese proverb 'gold corner, silver side and strawy void', and further improve it into 'maximum value in diamond cave' for solving the NP-hard cuboid packing problem. We extract, integrate and formalize the idea by west modern mathematical tools, and propose a pure quasi-human algorithm. The performance of the algorithm is evaluated on two sets of public benchmarks. For 100 strongly heterogeneous difficult benchmarks, experiments show an average packing utilization of 87.31%, which surpasses current best record reported in the literature by 1.83%. For 47 difficult benchmarks without orientation constraint, experiments show an average volume utilization of 92.05%, which improves current best record reported in the literature by 1.05%. 关键词：离散粒子群优化算法 NP问题求解矩形块布局问题 heuristic算法

相关文献

参考文献（10）
引证文献（8）
耦合文献（0）

参考文献(10)

引证文献(8)

互联网出版许可证新出网证(渝)字10号全国400电话 - 免长途话费

A pure quasi-human algorithm for solving the cuboid packing problem

参考文献(10)

引证文献(8)

用户提示