Research On The Algorithm Of Three-dimensional Bin Packing And Selecting

Since entering the new century,e-commerce platform and logistics enterprises have developed rapidly.Logistics transportation involves the packing of goods and the selecting of containers.Reasonable packing scheme and suitable container type can not only effectively improve the space utilization of containers,but also reduce unnecessary waste of cartons,thus reducing the transportation cost and material cost of goods.In addition,it can greatly improve the efficiency of workers' packing,avoid frequent adjustment of goods placement,and save a lot of time.Therefore,it has great theoretical and practical value to study the three-dimensional bin packing and selecting problem.Firstly,most of the existing bin packing algorithms lack consideration of the actual constraints,which reduces the feasibility and practicability of the algorithm in actual production.Therefore,this paper studies the key constraint that the goods should be placed along the edge of the pallet and the other 10 realistic constraints of the single bin-size strongly-heterogeneous items packing problem,and proposes a two-phase heuristic packing algorithm.In the first stage,the three-dimensional packing problem is transformed into the two-dimensional packing problem,that is,the goods are placed in layers,three types of twodimensional layout that meet the constraints are designed,and the stable support algorithm and slotting algorithm are proposed to form the layers for the remaining scattered goods.Finally,the layers are placed in the height direction of the pallet.The algorithm still achieves an average space utilization rate of nearly 80% under harsh constraints,which meets the requirements of actual production.Secondly,the size of the container has a great impact on the cost of the order.In this paper,the problem of optimizing the container type is attributed to the three-dimensional bin packing and selecting problem(BPSP).The problem is to design a specified number of containers with different specifications according to the previous order information and 3D packing algorithm.The cost of each kind of container includes freight cost,box material cost and filler material cost,which are related to the trilateral sum,surface area and space utilization rate of the container respectively.Aiming at BPSP's subproblem multiple bin-size strongly-heterogeneous items packing problem,this paper proposes a space segmentation algorithm based on pre packing strategy and bottom tiling strategy,and optimizes the goods placing order and subspace selection.The average space utilization rate of 85.6% is achieved in the actual test,which provides the basis for the next step of box selection algorithm.Finally,aiming at the problem of selecting containers in BPSP,a heuristic algorithm for optimization of container type is proposed.The generation of containers is combined with clustering algorithm,and the optimization of container size is to select the most suitable container type according to the information of goods in the order and the three-dimensional packing algorithm.In the actual case test,the algorithm can reduce the total freight and material cost by 17.84%.The experiment shows that the algorithm can effectively reduce the logistics cost.