The Research And Application Of The Dynamic Multi-objective 3-D Packing Problem

Packing problem has great application value.Logistics industry is the most direct and significant areas affected by the packing problem."Artificial intelligence" has become a symbol in today's era of Internet of things and Internet +,but the loading work is done according to the experience.So it is difficult to guarantee the space utilization and cost issues.Studying the 3-D packing problem is signality for improving the utilization and reducing the logistics costs for logistics companies.The paper built the integer programming model of the problem based on the actual conditions,designed the heuristic algorithm of dynamic loading based on the underlying priority.And applied to the actual three-dimensional packing problem for empirical research.First of all,this paper built the integer programming model of the three-dimensional packing problem.Analyzed the whole process of packing systematically and considered the loading stability and parallel constraint and so on,this paper built the model of the problem which has a single destination and single specification of packing case and goods by introducing0-1 variables.And on this basis,this paper built the other three hybrid optimization models of the three-dimensional packing problem respectively which have a single destination and single specification of packing case and variety specifications of goods and have multiple destinations and single specification of packing case and variety specifications of goods and have multiple destinations and variety specifications of packing case and goods.Then,this paper designed the dynamic heuristic algorithm which is based on the priority of underlying of the three-dimensional packing problem which has a single destination and single specification of packing case and goods according to the model.It is in accordance with the rule "from left to right and bottom to up" for packing.So the underlying scheme is important,it affects the space utilization directly.This paper designed the optimization model with the goal of maximizing volume to calculates the optimum solution for the basement and for the free space.And then adjusted the solution according the requirement of the stability to get the whole case.Finally,the rationality of the results are validated by the example.The model and the algorithm are used in the actual 3-D packing problems,and compared the results in the paper and in the documents.And the results show that the utilization reached more than ninety percent,it can get a reasonable solution quickly and satisfy all constraints by the hybrid optimization model.And it can get a solution whose space utilization is higher by the heuristic algorithm.