Research On Three-Dimensional Packing Problem Of Multi-Shape Regular Objects

In the field of computer science and industry,the packing problem has a very wide range of applications,including multiprocessor task scheduling,tailoring,resource allocation and real-life packaging of goods,object sorting and so on.There are many variations on the packing problem.And the most important and difficult problem to solve is the 3D packing.The three-dimensional packing problem is the core problem of the logistics loading and unloading link.The optimization of the packing problem plays a key role in increasing the profit of the logistics enterprise.There are many constraints in the packing problem.Before discussing the algorithm,it is necessary to distinguish the applicable environment of the algorithm.There are many practical situation that lead to different algorithms.A method for sphere online packing problems i5 proposed in this paper.The research on the three-dimensional packing problem of general regular objects is mostly for the packing of rectangular articles.When packing other regular items,it is usually converted into rectangular boxes.Therefore,when researching the sphere packing,it should be converted into the corresponding rectangular packing problem according to the situation.According to the loading of the circle in the two-dimensional space,by using the appropriate dividing space in the three-dimensional space to form the smallest unit cube for packing.In this paper,the rhombic dodecahedron is substituted for the rectangular body to become the unit body of the algorithm,which can make the sphere have a more suitable unit to make the space more fully utilized.And the bounded and unbounded space problems of the open and unopened states of the box are analyzed in detail.Under different spatial problems,the appropriate packing algorithm is used to carry out the simulation experiment.According to the experimental results,the asymptotic competition ratio of online variable size sphere three-dimensional packing is obtained.In addition,this article focus on the three-dimensional packing problem of rectangular objects,constructs a three-dimensional loading optimization lodel with a certain constraint condition and a single item packing without constraints,and gives an improved genetic algorithm for solving the model.The annealing algorithm is added to the genetic algorithm,combining the advantages of the two algorithms,and then through the analysis of the example,it proves that the new algorithm improves the storage rate and shortens the calculation time compared with the traditional optimization algorithm.