摘要
在货物的包装、存储及装载过程中,如何提高三维空间的利用率,同时又兼顾货物的重心平稳等约束,这属于复杂装箱问题。基于微积分的思想,作者提出一种虚拟装载模式的装载时分片算法,即在装载的同时不断对三维体虚拟切割分片,然后利用改进的剩余空间法对片空间进行分析和虚拟装填,通过非完全树的结构和递归搜索过程来实现最优装载模式的求解,并通过若干片的重新组合实现货物的重心平稳最优化。最后运用VC调用OPENGL完成仿真模拟系统,以应用实例证明了算法的正确性与可行性。
It＇s a complicated packing problem that how to promote capacity of container regulating with barycenter balance. Based on infinitesimal analysis, an integration packing slicing algorithm for virtual packing is provided in this paper. It means cutting a container in the course of packing and infilling the slice according to spare space algorithm, then using n-dichotomous tree structure and recursion searching and thus an optimal solution is developed. A research about barycenter balance by the slice assemblage is given, and an emulation system compiled by VC transferring OPENGL is developed in this paper. The algorithm is proved feasible by application examples.
出处
《工程图学学报》
CSCD
北大核心
2005年第5期6-13,共8页
Journal of Engineering Graphics
关键词
计算机应用
最优装载
截余空间
剩余空间
分片
computer application
optimal packing
cutting space
spare space
slicing
