Method and apparatus for optimized shipping strategies accounting for endpoint requirements

• US 9,373,098 B2
• Filed: 11/19/2013
• Issued: 06/21/2016
• Est. Priority Date: 05/24/2011
• Status: Active Grant

• Current Assignee: Intelligrated Incorporated (Honeywell International Inc.)
• Original Assignee: Intelligrated Incorporated (Honeywell International Inc.)
• Inventors: Nashif, Hazem Nizar An, Brady, Thomas Frederick
• Primary Examiner(s): Logan, Kyle
• Application Number:
  US14/083,796
• Publication Number:
  US 20140074745A1
• Time in Patent Office: 945 Days
• Field of Search: 700/216
• US Class Current: 1/1
• CPC Class Codes: G06Q 10/04 Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem" market predictions or forecasting for commercial activities G06Q30/0202
• CPC Class Codes: G06Q 10/08 Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
• CPC Class Codes: G06Q 10/083 Shipping

Abstract

Systems, methods, and devices of the various embodiments enable cartonization of products for store replenishment based on the individual store layout of each store of a group of stores to which the cartonized products are to be provided.

Claims

1. A method, comprising:

receiving, at a warehouse control computer, a fulfillment order indicating a plurality of products;

identifying, at the warehouse control computer, a store to which each of the plurality of products is to be shipped;

determining, at the warehouse control computer, a plan for placing each of the plurality of products into a set of cartons based on layout information stored in a memory accessible by the warehouse control computer for each identified store to which each of the plurality of products is to be shipped;

determining, at the warehouse control computer, a plan for placing each of the plurality of products into a set of cartons based on layout information stored in a memory accessible by the warehouse control computer for each identified store to which each of the plurality of products is to be shipped comprises;

identifying, at the warehouse control computer, a location of each of the plurality of products in each identified store to which each of the plurality of products is to be shipped based on the layout information for each identified store;

assigning each of the plurality of products to the set of cartons in the plan such that locations of products in any one carton of the set of cartons in the plan do not violate an adjacency grouping rule by selecting one of a size and a number of cartons to accommodate the plurality of products;

generating, at the warehouse control computer, a set of instructions to control an operation of a cartonization system to control which of the plurality of products should be added to each carton of the set of cartons by automated sorting based at least in part on the determined plan; and

sending the set of instructions from the warehouse control computer to the cartonization system.

2. The method of claim 1, wherein the memory accessible by the warehouse control computer has stored therein unique layout information for each identified store.

3. The method of claim 1, wherein the cartonization system comprises a batch sorter.

4. The method of claim 1, wherein determining the plan for placing each of the plurality of products into the set of cartons comprises:

determining that layout information is not stored in the memory for at least a portion of a selected identified store to which each of the plurality of products is to be shipped; and

assigning any products associated with the at least a portion of the selected identified store to a default sequence that are sorted and placed in one or more other containers.

5. The method of claim 1, wherein the cartonization system comprises a loop sorter.

6. The method of claim 5, wherein the loop sorter comprises a selected one of a cross belt sorter and a tilt-tray sorter.

7. The method of claim 1, wherein the layout information of each identified store is a planogram indicating a department, an aisle, an aisle side, a bay, a shelf, and a position that identifies the location of each of the plurality of products in that respective store.

8. The method of claim 7, wherein the adjacency grouping rule is a requirement that products have the same handling, safety, and quality restrictions.

9. The method of claim 7, wherein the adjacency grouping rule is a requirement that the locations of products in any one carton of the set of cartons have a same department and same aisle.

10. The method of claim 9, wherein the adjacency grouping rule is a requirement that the locations of products in any one carton of the set of cartons have the same department, the same aisle, and a same aisle side.

11. A warehouse control computer, comprising;

a memory; and

a processor connected to the memory, the processor configured with processor-executable instructions to perform operations comprising;

receiving a fulfillment order indicating a plurality of products;

identifying a store to which each of the plurality of products is to be shipped;

determining a plan for placing each of the plurality of products into a set of cartons based on layout information stored in the memory for each identified store to which each of the plurality of products is to be shipped;

determining, at the warehouse control computer, a plan for placing each of the plurality of products into a set of cartons based on layout information stored in a memory accessible by the warehouse control computer for each identified store to which each of the plurality of products is to be shipped comprises;

identifying, at the warehouse control computer, a location of each of the plurality of products in each identified store to which each of the plurality of products is to be shipped based on the layout information for each identified store;

assigning each of the plurality of products to the set of cartons in the plan such that locations of products in any one carton of the set of cartons in the plan do not violate an adjacency grouping rule by selecting one of a size and a number of cartons to accommodate the plurality of products;

generating a set of instructions to control an operation of a cartonization system to control which of the plurality of products should be added to each carton of the set of cartons by automated sorting based at least in part on the determined plan; and

sending the set of instructions to the cartonization system.

12. The warehouse control computer of claim 11, wherein the memory has stored therein unique layout information for each identified store.

13. The warehouse control computer of claim 11, wherein the cartonization system comprises a batch sorter.

14. The warehouse control computer of claim 11, wherein the processor is configured with processor-executable instructions to perform operations comprising:

determining that layout information is not stored in the memory for at least a portion of a selected identified store to which each of the plurality of products is to be shipped; and

assigning any products associated with the at least a portion of the selected identified store to a default sequence that are sorted and placed in one or more other containers.

15. The warehouse control computer of claim 11, wherein the cartonization system comprises a loop sorter.

16. The warehouse control computer of claim 15, wherein the loop sorter comprises a selected one of a cross belt sorter and a tilt-tray sorter.

17. The warehouse control computer of claim 11, wherein the processor is configured with processor-executable instructions to perform operations such that the layout information of each identified store is a planogram indicating a department, an aisle, an aisle side, a bay, a shelf, and a position that identifies the location of each of the plurality of products in that respective store.

18. The warehouse control computer of claim 17, wherein the processor is configured with processor-executable instructions to perform operations such that the adjacency grouping rule is a requirement that products have the same handling, safety, and quality restrictions.

19. The warehouse control computer of claim 17, wherein the processor is configured with processor-executable instructions to perform operations such that the adjacency grouping rule is a requirement that the locations of products in any one carton of the set of cartons have a same department and same aisle.

20. The warehouse control computer of claim 19, wherein the adjacency grouping rule is a requirement that the locations of products in any one carton of the set of cartons have the same department, the same aisle, and a same aisle side.

21. A non-transitory processor readable storage medium having stored thereon processor-executable instructions configured to cause a processor to perform operations comprising:

receiving a fulfillment order indicating a plurality of products;

identifying a store to which each of the plurality of products is to be shipped;

determining a plan for placing each of the plurality of products into a set of cartons based on layout information stored in a memory accessible by the processor for each identified store to which each of the plurality of products is to be shipped;

determining, at the warehouse control computer, a plan for placing each of the plurality of products into a set of cartons based on layout information stored in a memory accessible by the warehouse control computer for each identified store to which each of plurality of products is to be shipped comprises;

identifying, at the warehouse control computer, a location of each of the plurality of products in each identified store to which each of the plurality of products is to be shipped based on the layout information for each identified store;

assigning each of the plurality of products to the set of cartons in the plan such that locations of products in any one carton of the set of cartons in the plan do not violate an adjacency grouping rule by selecting one of a size and a number of cartons to accommodate the plurality of products;

generating a set of instructions to control an operation of a cartonization system to control which of the plurality of products should be added to each carton of the set of cartons by automated sorting based at least in part on the determined plan; and

sending the set of instructions from the processor to the cartonization system.

22. The non-transitory processor readable storage medium of claim 21, wherein the processor-executable instructions are configured to cause the processor to perform operations such that the memory accessible by the processor has stored therein unique layout information for each identified store.

23. The non-transitory processor readable storage medium of claim 21 wherein the cartonization system comprises a batch sorter.

24. The non-transitory processor readable storage medium of claim 21, wherein the processor-executable instructions are configured to cause the processor to perform operations comprising:

determining that layout information is not stored in the memory for at least a portion of a selected identified store to which each of the plurality of products is to be shipped; and

assigning any products associated with the at least a portion of the selected identified store to a default sequence that are sorted and placed in one or more other containers.

25. The non-transitory processor readable storage medium of claim 21, wherein the processor-executable instructions are configured to cause the processor to perform operations such that the cartonization system comprises a loop sorter.

26. The non-transitory processor readable storage medium of claim 25 wherein the loop sorter comprises a selected one of a cross heft sorter and a tilt-tray sorter.

27. The non-transitory processor readable storage medium of claim 21, wherein the processor-executable instructions are configured to cause the processor to perform operations such that the layout information of each identified store is a planogram indicating a department, an aisle, an aisle side, a bay, a shelf;

and a position that identifies the location of each of the plurality of products in that respective store.

28. The non-transitory processor readable storage medium of claim 27, wherein the processor-executable instructions are configured to cause the processor to perform operations such that the adjacency grouping rule is a requirement that products have the same handling, safety, and quality restrictions.

29. The non-transitory processor readable storage medium of claim 27, wherein the processor-executable instructions are configured to cause the processor to perform operations such that the adjacency grouping rule is a requirement that the locations of products in any one carton of the set of cartons have a same department and same aisle.

30. The non-transitory processor readable storage medium of claim 29, wherein the processor-executable instructions are configured to cause the processor to perform operations such that the adjacency grouping rule is a requirement that the locations of products in any one carton of the set of cartons have the same department, the same aisle, and a same aisle side.