Three-dimensional container stuffing method based on combination heuristics

Abstract

The invention discloses a three-dimensional container stuffing method based on combination heuristics. The method comprises the steps that a three-dimensional coordinate system is established on the basis of a container body of a three-dimensional container; then the placement rule of goods in the container is made; the encasement process of the goods is simulated repeatedly according to the different encasement requirements of the goods; and finally, the total volumes of the goods which are put into the three-dimensional container in the repeated simulated encasement processes are calculatedin a statistics mode, the values of the total volumes are compared, placement starting points of the goods in the simulated encasement process with the maximum total volume of the goods which are putinto the three-dimensional container are outputted, the corresponding goods are put into the container according to the placement starting points, and therefore the container stuffing is achieved. Themethod has the advantages that the goods encasement scheme with the highest three-dimensional container stuffing rate can be given out in the short time period according to the goods with the different encasement requirements, and the stuffing rate is high on the basis that the stuffing efficiency is guaranteed.

Description

technical field [0001] The invention relates to a three-dimensional container packing method, in particular to a combination heuristic-based three-dimensional container packing method. Background technique [0002] At present, the three-dimensional container packing problem is usually described as: how to pack multiple containers with given external dimensions and packing requirements (head loading, tail loading, carrying pallet loading, loading with no other cargo on top, and ordinary loading) The goods are loaded into a rectangular container with known length, width and height (the total loading volume is known), and there is no embedded relationship between the goods, and finally the total volume of the goods loaded into the container is maximized. At this time, the container’s The loading rate is maximum. The three-dimensional container packing problem is a classic problem in the field of logistics. It is of great significance to study how to improve the utilization rat...

AI Technical Summary

Problems solved by technology

However, the above-mentioned genetic algorithm, taboo algorithm or simulated annealing algorithm do not consider the different packing requirements of the goods in the packing process, and in practical applications, there are often various packing requirements for the goods packed in the same container. When these factors are taken into account, the bin packing rate of the above algorithms is not high

Images