Research On The Single Container Loading Problem Considering Operation Friendliness

Container loading is one of the three-dimensional packing problems.Such problems are widely used in many areas such as port loading,airport loading,pallet izing loading and so on.Logistics and transportation become more important with the rapid development of the market economy.As a key technology to improve resource utilization,the algorithm to solve the packing problem is of great significance in making full use of transportation capacity,reducing material loss and protecting natural resources.At present,many enterprises rely on manual calculation in the process of container loading.Despite the rapid development of logistics business,the quantity and quality of packing software has not been greatly improved.So far,scholars have done a lot of research on the packing problem and published various methods to solve the problem.In this paper,based on the previous studies,considering the friendliness of workers,a new packing algorithm is proposed,which is expected to solve the packing problem with a higher efficiency by using a new method.In this paper,we study the three-dimensional strip packing problem with practical constraints,and propose an efficient heuristic random local search algorithm for the thr eedimensional strip packing problem.Firstly,based on the open space,a basic heuristic algorithm is proposed to load items in a fixed way until the items are all placed.The remaining space is divided according to the definition of open space.In additi on,the maximum length overlap constraint is considered and the strategy of phased cutting and deleting is used to solve this problem;Secondly,we proposed orientation optimization algorithm,which shuffles the orientation list of the selected items,calculates the loading plan and retains the better plan and orientation list.Thirdly,we proposed a random local search,which swaps different orders in the same warehouse and items with different specifications in the same order to generate a new item list a s the basic heuristic input,and uses the greedy strategy to retain the better loading plan and item list.In this paper,100 test data of 3D packing in Shenzhen Sinotrans Logistics Co.,Ltd.are tested.The experimental results have achieved a good loading rate.This paper compares different experimental groups,analyzes the impact of different practical constraints on the loading.The results provide a reference for how to balance constraints and loading effects in the actual loading,and we also show the loading plan visually.Finally,we introduce and demonstrate the robot palletizing system based on the improved packing algorithm.