Research And System Development Of 3D Bin Packing Algorithm

The 3D Bin Packing problem is a kind of combinatorial optimization problem,which has been widely used in production and daily life,especially in close connection with the logistics transportation industry that is now emerging.In the logistics distribution process,packing or loading is an indispensable link.A reasonable packing scheme can not only improve the space utilization of the car,reduce vehicle waste,and reduce logistics costs,but also provide a decision reference for on-site packing.If it is supplemented by automated equipment,fully automatic packing will become possible,which will greatly reduce the logistics cost of the enterprise and improve the market competitiveness of the enterprise.Therefore,the research on the 3D Bin Packing problem has very important economic value.For a long time,the 3D Bin Packing problem has been a hot research topic.The predecessors have proposed many packing algorithms,such as simulated annealing algorithm,ant colony algorithm,genetic algorithm,etc.,but when the scale of the problem and the constraints increase,these single algorithms often show many shortcomings.Through researching a large number of references,conducting research and repeated experiments,this paper proposes a hybrid genetic algorithm integrating heuristic algorithm and genetic algorithm to solve the 3D Bin Packing problem,and develops a 3D bin packing software system to verify the effectiveness of the algorithm and feasibility.The paper first introduces the research background and significance of the subject,gives the latest research status at home and abroad,and then establishes a mathematical model of the 3D Bin Packing problem studied in this paper on the basis of a comprehensive description of the concepts and applications of various packing problems.To solve this problem,this paper designs the heuristic algorithm from three aspects: space segmentation,space merging,and simple block generation.The first stage of the heuristic algorithm binning step is given.Next,the second stage of genetic algorithm research is introduced.The algorithm improves the predecessor's coding method.It innovatively proposes a two-stage coding that combines the loading order and the placement state.The selected fitness function is consistent with the objective function of the 3D Bin Packing problem.When designing genetic operations,conflicts are introduced.The check and replacement mechanism improves the two-point crossover method.Next,the genetic algorithm and the heuristic algorithm are integrated to generate a hybrid genetic algorithm,and the boxing steps of the algorithm are given.Finally,the modern computer technology was used to develop a 3D bin packing software system.In order to verify the effectiveness of the hybrid genetic algorithm and the packing software system,the Loh & Nee series of examples mentioned in the literature and the actual examples of enterprises were used for testing.The algorithm can significantly improve the space utilization of packing,and the software system is also very feasible and practical.