Systems and methods for computer-determined efficient bagging of ordered items

Patent metadata

Field	Value
Publication number	US-10705488-B1
Application number	US-201916576083-A
Country	US
Kind code	B1
Filing date	Sep 19, 2019
Priority date	Sep 19, 2019
Publication date	Jul 7, 2020
Grant date	Jul 7, 2020

Abstract

The present disclosure provides systems and methods for automated bag packaging, comprising at least one processor; and memory storing comprising: receiving an order comprising at least one item; searching at least one data store to determine one or more properties associated with each item; for each group: performing an optimization process for packaging the at least one item into one or more bags, by: selecting a data structure representing a first bag, the data structure comprising a size of the first bag; iteratively simulating packaging of a largest item of the group into the first bag until all items are packaged in the selected bag; generating at least one set of instructions for packaging the items into the selected bag; and sending the generated instructions to a computer system for display, the instructions including at least one item identifier and one bag identifier.

First claim

What is claimed is:

1. A computerized system for automated bag packaging, comprising:
at least one processor; and
at least one non-transitory storage medium comprising instructions that, when executed by the at least one processor, cause the at least one processor to perform steps comprising:
receiving, from a remote system, an order comprising at least one item;
searching, by the at least one processor, at least one data store to determine one or more properties associated with each item;
performing, by the at least one processor, an optimization process for packaging the at least one item into one or more bags, by:
selecting a data structure representing a first bag, the data structure comprising measurements of the first bag,
iteratively simulating packaging of a largest item into the first bag until all items are packaged in the selected bag, by:
 determining dimensions of each item,
 determining the largest item by determining an item with a longest dimension,
 simulating packing the largest item into the first bag,
 calculating remaining spaces in the first bag based by subtracting the dimensions of the largest item from the dimensions of the first package, and
 iteratively simulating packing at least one remaining item into the calculated remaining spaces; and
generating at least one set of instructions for packaging the items into the selected bag; and

sending, by the at least one processor, the generated instructions to a computer system for display, the instructions including at least one item identifier and one bag identifier.

2. The system of claim 1 , wherein the size of the first bag comprises a width of the first bag (bWidth) and a length of the first bag (bLength).

3. The system of claim 2 , wherein a maximum virtual height (vHeight) of the first bag is based on the width of the first bag (bWidth) and the length of the first bag (bLength).

4. The system of claim 3 , wherein the maximum virtual height of the first bag (vHeight) is computed as
v Height=9+(−2( b Length+ b Width))+( b Length* b Width).

5. The system of claim 4 , wherein:
iteratively simulating packaging comprises iteratively simulating packaging the at least one item into a virtual box associated with the first bag, and
the dimensions of the virtual box are calculated based on the virtual height of the first bag, the width of the first bag, and the length of the first bag.

6. The system of claim 5 , wherein the dimensions of the virtual box include a height, a width, and a length:
the height of the virtual box is equal to the virtual height of the first bag;
the width of the virtual box is equal to the width of the first bag less the virtual height; and
the length of the virtual box is equal to the length of the first bag less the virtual height.

7. The system of claim 5 , wherein:
performing the optimization process further comprises dividing the virtual box into a number of equal-volume sub-boxes; and
iteratively simulating packaging items into the one or more bags comprises iteratively simulating packaging items into the sub-boxes.

8. The system of claim 7 , wherein the number of equal-volume sub-boxes comprises eight sub-boxes.

9. The system of claim 1 , wherein if the simulating determines that the at least one item does not fit into the selected bag:
choosing a larger bag, and
iteratively computationally packaging the largest item until all items are packed in the larger bag.

10. A computer-implemented method for automated bag packaging, comprising:
receiving, from a remote system, an order comprising at least one item;
searching at least one data store to determine one or more properties associated with each item;
performing an optimization process for packaging the at least one item into one or more bags, by:
selecting a data structure representing a first bag, the data structure comprising measurements of the first bag,
iteratively simulating packaging of a largest item into the first bag until all items are packaged in the selected bag,
determining that the at least one item does not fit into the first bag,
choosing a larger bag, and
iteratively computationally packaging the largest item until all items are packed in the larger bag,
generating at least one set of instructions for packaging the items into the larger bag; and

sending the generated instructions to a computer system for display, the instructions including at least one item identifier and one bag identifier.

11. The computer-implemented method of claim 10 , wherein the size of the first bag comprises a width of the first bag (bWidth) and a length of the first bag (bLength).

12. The computer-implemented method of claim 11 , wherein a maximum virtual height (vHeight) of the first bag is based on the width of the first bag (bWidth) and the length of the first bag (bLength).

13. The computer-implemented method of claim 12 , wherein the maximum virtual height of the first bag (vHeight) is computed as
v Height=9+(−2*( b Length+ b Width))+( b Length* b Width).

14. The computer-implemented method of claim 13 , wherein:
iteratively simulating packaging comprises iteratively simulating packaging the at least one item into a virtual box associated with the first bag, and
the dimensions of the virtual box are calculated based on the virtual height of the first bag, the width of the first bag, and the length of the first bag.

15. The computer-implemented method of claim 14 , wherein the dimensions of the virtual box include a height, a width, and a length:
the height of the virtual box is equal to the virtual height of the first bag;
the width of the virtual box is equal to the width of the first bag less the virtual height; and
the length of the virtual box is equal to the length of the first bag less the virtual height.

16. The computer-implemented method of claim 14 , wherein:
performing the optimization process further comprises dividing the virtual box into a number of equal-volume sub-boxes; and
iteratively simulating packaging items into the one or more bags comprises iteratively simulating packaging items into the sub-boxes.

17. The computer-implemented method of claim 10 further comprises:
determining dimensions of each item;
determining the largest item by determining an item with a longest dimension;
simulating packing the largest item into the first bag;
calculating remaining spaces in the first bag based by subtracting the dimensions of the largest item from the dimensions of the first package; and
iteratively simulating packing at least one remaining item into the calculated remaining spaces.

18. A computer-implemented system for automated bag packaging, comprising:
receiving, from a remote system, an order comprising at least one item;
searching at least one data store to determine one or more properties associated with each item;
performing an optimization process for packaging the at least one item into one or more bags, by:
selecting a data structure representing a first bag, the data structure comprising measurements of the first bag, wherein:
the size of the first bag comprises a width of the first bag (bWidth) and a length of the first bag (bLength), and
a maximum virtual height of the first bag (vHeight) is computed as: vHeight=9+(−2*(bLength+bWidth))+(bLength*bWidth); and

iteratively simulating packaging of a largest item of the group into the first bag until all items are packaged in the selected bag;
generating at least one set of instructions for packaging the items into the selected bag; a

Assignees

• Coupang Corp

Inventors

• Cui Xiaohua
• Xu Zhijun
• Zhao Rubin

Classifications

• G06Q10/10

  Office automation; Time management · CPC title

• G06Q10/0832

  Special goods or special handling procedures, e.g. handling of hazardous or fragile goods · CPC title

• G06Q10/087 Primary

  Inventory or stock management, e.g. order filling, procurement or balancing against orders · CPC title

• H05K7/1497

  Rooms for data centers; Shipping containers therefor · CPC title

• E06B11/021

  Wire gates, e.g. traction gates; Fastenings therefor (insulators, poles, handles, or the like, in electric fences H01B17/145) · CPC title