[1]Allen S D, Burke E K, Kendall G. A hybrid placement strategy for the threedimensional strip packing problem[J]. European Journal of Operational Research, 2011, 209(3): 219227. [2]Wu Y, Li W K, Goh M, et al. Threedimensional bin packing problem with variable bin height[J]. European Journal of Operational Research, 2010, 202(2): 347355. [3]张德富, 彭煜, 朱文兴, 等. 求解三维装箱问题的混合模拟退火算法[J]. 计算机学报, 2009, 32(11): 21472156. ZHANG Defu, PENG Yu, ZHU Wenxin, et al. A hybrid simulated annealing algorithm for the threedimensional packing problem[J]. Chinese Journal of Computers, 2009, (11): 21472156. [4]翟钰,孙小明.多种物品三维装箱问题的一种启发式算法[J]. 上海交通大学学报,2007, 41(8): 12441247. ZHAI Yu, SUN Xiaoming. A heuristic algorithm for threedimensional container loading problem with nonidentical items[J]. Journal of Shanghai Jiaotong University, 2007, 41(8): 12441247. [5]Bortfeldt A, Mack D. A heuristic for the threedimensional strip packing problem[J]. European Journal of Operational Research, 2007, 183(3): 12671279. [6]AlRaoush R, Alsaleh M. Simulation of random packing of polydisperse particles[J]. Powder Technology, 2007,176(1): 4755. [7]Art J R C . An approach to the two dimensional irregular cutting stock problem[R]. Cambridge: IBM Cambridge Centre, 1966 [8]Burke E K, Hellier R S R, Kendall G, et al. Complete and robust nofit polygon generation for the irregular stock cutting problem[J]. European Journal of Operational Research, 2007, 179(1): 2749. [9]Stoyan Y G, Gil M, Pankratov A V, et al. Packing nonconvex polytopes into a parallelepiped[R].MATHNM062004.Technische Universitt of Dresden,2004. [10]Cui S L, Zhang S Q, Chen X X, et al. Pointinpolyhedra test with direct handling of degeneracies[J]. GeoSpatial Information Science, 2011, 14(2): 9197. [11]Liu X, Ye J W. Heuristic algorithm based on the principle of minimum total potential energy (HAPE): A new algorithm for nesting problems[J]. Journal of Zhejiang UniversityScience A, 2011, 12(11): 860872. |