The information of the container:
Container width: 10 Container depth: 10 Container height: 10
The packing Items are as following: 
Item number: 3 Customer number: 3Item width: 4 Item depth: 6 Item Height: 8
Item number: 5 Customer number: 3Item width: 5 Item depth: 6 Item Height: 5
Item number: 2 Customer number: 2Item width: 10 Item depth: 7 Item Height: 10
Item number: 1 Customer number: 2Item width: 6 Item depth: 6 Item Height: 2
Item number: 4 Customer number: 1Item width: 9 Item depth: 4 Item Height: 8
 The continuous lower bound is: 1.402
 The new lower bound one is: 2
 The new lower bound twe is: 2
The upper bound of the 3D-Binpacking problem is: 1.7
The usage rate is: 0.824706
The items can not packed in a singe bin using branch-and-bound
Time it used is: 0.015
The information of the container:
Container width: 10 Container depth: 10 Container height: 10
The packing Items are as following: 
Item number: 5 Customer number: 3Item width: 10 Item depth: 5 Item Height: 5
Item number: 2 Customer number: 3Item width: 7 Item depth: 2 Item Height: 5
Item number: 4 Customer number: 2Item width: 8 Item depth: 6 Item Height: 10
Item number: 1 Customer number: 2Item width: 6 Item depth: 9 Item Height: 5
Item number: 3 Customer number: 2Item width: 1 Item depth: 4 Item Height: 6
 The continuous lower bound is: 1.094
 The new lower bound one is: 2
 The new lower bound twe is: 2
The upper bound of the 3D-Binpacking problem is: 2
The usage rate is: 0.547
The items can not packed in a singe bin using branch-and-bound
Time it used is: 0
The information of the container:
Container width: 10 Container depth: 10 Container height: 10
The packing Items are as following: 
Item number: 1 Customer number: 2Item width: 7 Item depth: 1 Item Height: 7
Item number: 4 Customer number: 1Item width: 6 Item depth: 7 Item Height: 5
Item number: 2 Customer number: 1Item width: 3 Item depth: 4 Item Height: 9
Item number: 3 Customer number: 1Item width: 5 Item depth: 3 Item Height: 3
Item number: 5 Customer number: 1Item width: 2 Item depth: 3 Item Height: 4
 The continuous lower bound is: 0.436
 The new lower bound one is: 1
 The new lower bound twe is: 1
The upper bound of the 3D-Binpacking problem is: 1.2
The usage rate is: 0.363333
 The coordinate of the packed items using branch-and-bound are as following:
Item number: 1 Customer number: 2 X-coordinate: 0 Y-coordinate: 0 Z-coordinate: 0
Item number: 4 Customer number: 1 X-coordinate: 0 Y-coordinate: 0 Z-coordinate: 1
Item number: 2 Customer number: 1 X-coordinate: 7 Y-coordinate: 0 Z-coordinate: 0
Item number: 3 Customer number: 1 X-coordinate: 0 Y-coordinate: 5 Z-coordinate: 1
Item number: 5 Customer number: 1 X-coordinate: 5 Y-coordinate: 5 Z-coordinate: 1
The usage rates of the space is: 0.908333
Time it used is: 0.032
The information of the container:
Container width: 10 Container depth: 10 Container height: 10
The packing Items are as following: 
Item number: 4 Customer number: 3Item width: 7 Item depth: 9 Item Height: 9
Item number: 3 Customer number: 3Item width: 2 Item depth: 1 Item Height: 1
Item number: 2 Customer number: 2Item width: 10 Item depth: 9 Item Height: 4
Item number: 1 Customer number: 2Item width: 7 Item depth: 2 Item Height: 10
Item number: 5 Customer number: 1Item width: 7 Item depth: 2 Item Height: 4
 The continuous lower bound is: 1.125
 The new lower bound one is: 2
 The new lower bound twe is: 2
The upper bound of the 3D-Binpacking problem is: 1.3
The usage rate is: 0.865385
The items can not packed in a singe bin using branch-and-bound
Time it used is: 0
The information of the container:
Container width: 10 Container depth: 10 Container height: 10
The packing Items are as following: 
Item number: 2 Customer number: 3Item width: 6 Item depth: 1 Item Height: 8
Item number: 1 Customer number: 2Item width: 6 Item depth: 4 Item Height: 10
Item number: 4 Customer number: 2Item width: 5 Item depth: 10 Item Height: 4
Item number: 5 Customer number: 2Item width: 1 Item depth: 10 Item Height: 3
Item number: 3 Customer number: 1Item width: 8 Item depth: 10 Item Height: 8
 The continuous lower bound is: 1.158
 The new lower bound one is: 1
 The new lower bound twe is: 2
The upper bound of the 3D-Binpacking problem is: 2.5
The usage rate is: 0.4632
The items can not packed in a singe bin using branch-and-bound
Time it used is: 0
The information of the container:
Container width: 10 Container depth: 10 Container height: 10
The packing Items are as following: 
Item number: 3 Customer number: 3Item width: 5 Item depth: 8 Item Height: 6
Item number: 4 Customer number: 3Item width: 6 Item depth: 2 Item Height: 8
Item number: 5 Customer number: 2Item width: 4 Item depth: 9 Item Height: 3
Item number: 2 Customer number: 2Item width: 3 Item depth: 6 Item Height: 5
Item number: 1 Customer number: 1Item width: 6 Item depth: 7 Item Height: 3
 The continuous lower bound is: 0.66
 The new lower bound one is: 1
 The new lower bound twe is: 1
The upper bound of the 3D-Binpacking problem is: 2.6
The usage rate is: 0.253846
 The coordinate of the packed items using branch-and-bound are as following:
Item number: 3 Customer number: 3 X-coordinate: 0 Y-coordinate: 3 Z-coordinate: 2
Item number: 4 Customer number: 3 X-coordinate: 0 Y-coordinate: 0 Z-coordinate: 0
Item number: 5 Customer number: 2 X-coordinate: 6 Y-coordinate: 0 Z-coordinate: 0
Item number: 2 Customer number: 2 X-coordinate: 5 Y-coordinate: 3 Z-coordinate: 2
Item number: 1 Customer number: 1 X-coordinate: 0 Y-coordinate: 0 Z-coordinate: 2
The usage rates of the space is: 0.93617
Time it used is: 0.031
The information of the container:
Container width: 10 Container depth: 10 Container height: 10
The packing Items are as following: 
Item number: 5 Customer number: 3Item width: 8 Item depth: 7 Item Height: 4
Item number: 4 Customer number: 3Item width: 4 Item depth: 5 Item Height: 1
Item number: 2 Customer number: 2Item width: 9 Item depth: 8 Item Height: 9
Item number: 1 Customer number: 2Item width: 7 Item depth: 7 Item Height: 5
Item number: 3 Customer number: 1Item width: 1 Item depth: 7 Item Height: 5
 The continuous lower bound is: 1.172
 The new lower bound one is: 2
 The new lower bound twe is: 2
The upper bound of the 3D-Binpacking problem is: 2.2
The usage rate is: 0.532727
The items can not packed in a singe bin using branch-and-bound
Time it used is: 0.016
The information of the container:
Container width: 10 Container depth: 10 Container height: 10
The packing Items are as following: 
Item number: 5 Customer number: 3Item width: 3 Item depth: 6 Item Height: 2
Item number: 1 Customer number: 1Item width: 7 Item depth: 10 Item Height: 6
Item number: 4 Customer number: 1Item width: 3 Item depth: 5 Item Height: 5
Item number: 2 Customer number: 1Item width: 6 Item depth: 3 Item Height: 4
Item number: 3 Customer number: 1Item width: 8 Item depth: 5 Item Height: 1
 The continuous lower bound is: 0.643
 The new lower bound one is: 1
 The new lower bound twe is: 1
The upper bound of the 3D-Binpacking problem is: 1.5
The usage rate is: 0.428667
 The coordinate of the packed items using branch-and-bound are as following:
Item number: 5 Customer number: 3 X-coordinate: 0 Y-coordinate: 7 Z-coordinate: 0
Item number: 1 Customer number: 1 X-coordinate: 0 Y-coordinate: 0 Z-coordinate: 0
Item number: 3 Customer number: 1 X-coordinate: 7 Y-coordinate: 0 Z-coordinate: 0
Item number: 3 Customer number: 1 X-coordinate: 0 Y-coordinate: 6 Z-coordinate: 6
Item number: 3 Customer number: 1 X-coordinate: 0 Y-coordinate: 6 Z-coordinate: 0
The usage rates of the space is: 0.885675
Time it used is: 0.031
The information of the container:
Container width: 10 Container depth: 10 Container height: 10
The packing Items are as following: 
Item number: 3 Customer number: 2Item width: 4 Item depth: 4 Item Height: 10
Item number: 1 Customer number: 2Item width: 8 Item depth: 2 Item Height: 8
Item number: 2 Customer number: 2Item width: 2 Item depth: 5 Item Height: 8
Item number: 4 Customer number: 1Item width: 3 Item depth: 8 Item Height: 10
Item number: 5 Customer number: 1Item width: 7 Item depth: 4 Item Height: 3
 The continuous lower bound is: 0.692
 The new lower bound one is: 0
 The new lower bound twe is: 1
The upper bound of the 3D-Binpacking problem is: 1.8
The usage rate is: 0.384444
 The coordinate of the packed items using branch-and-bound are as following:
Item number: 3 Customer number: 2 X-coordinate: 3 Y-coordinate: 0 Z-coordinate: 2
Item number: 1 Customer number: 2 X-coordinate: 0 Y-coordinate: 0 Z-coordinate: 0
Item number: 2 Customer number: 2 X-coordinate: 8 Y-coordinate: 0 Z-coordinate: 0
Item number: 4 Customer number: 1 X-coordinate: 0 Y-coordinate: 0 Z-coordinate: 2
Item number: 5 Customer number: 1 X-coordinate: 3 Y-coordinate: 0 Z-coordinate: 6
The usage rates of the space is: 0.918991
Time it used is: 0.016
The information of the container:
Container width: 10 Container depth: 10 Container height: 10
The packing Items are as following: 
Item number: 2 Customer number: 3Item width: 9 Item depth: 10 Item Height: 5
Item number: 4 Customer number: 2Item width: 2 Item depth: 8 Item Height: 4
Item number: 5 Customer number: 1Item width: 10 Item depth: 5 Item Height: 3
Item number: 1 Customer number: 1Item width: 8 Item depth: 5 Item Height: 1
Item number: 3 Customer number: 1Item width: 1 Item depth: 2 Item Height: 8
 The continuous lower bound is: 0.72
 The new lower bound one is: 1
 The new lower bound twe is: 1
The items can not packed in a singe bin using branch-and-bound
Time it used is: 0.015