A quasi-human algorithm for solving the three-dimensional rectangular packing problem
Science China Information Sciences(2010)
摘要
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%.
更多查看译文
关键词
NP hard,three-dimensional packing,quasi-human,action space,caving degree
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络