Multibox Three-Dimensional Packing Problems for Heterogeneous Extrudable Items

Algorithm 1

Heterogeneous squeezable items multibin 3D packing algorithm.

	Input: packages set , order data set , item set ;
	Output: packing solution for each order;
	Start
	Step 1: sort the packages in order of maximum volume from largest to smallest.
	Step 2: reading order data and sorting the squeezable items by size of the items from largest to smallest after squeezing them.
(1)	For n = 0 to N (traversing the order set)
(2)	Calculate the total volume of all unboxed items in the current order
(3)	Selecting packages that are slightly larger than the total volume of all unboxed items in the order
(4)	For j = 0 to total number of items in the current order (traversing items in order )
(5)	Update load point information set
(6)	For a = 1 to (traversing the set of loading points)
(7)	For b = 1 to 6 (traversing the set of boxing directions)
(8)	If the current item can be loaded in the current direction
(9)	Then load current item
(10)	Break
(11)	Else
(12)	b++;
(13)	End If
(14)	End For
(15)	If the current item has been loaded into
(16)	Break
(17)	Else
(18)	a++;
(19)	End If
(20)	End For
(21)	If the current item has been loaded into
(22)	j++;
(23)	Else
(24)	Discard the current package and select a package with a slightly larger volume than the current package to start packing again.
(25)	End If
(26)	End For
(27)	n++;
(28)	End For
	Step 3: output individual order packing solutions.
	End