IP Library › Granted Patent US 12,236,395
Granted Patent B2
US 12,236,395 · App. 18/238,402 · Granted Feb 25, 2025

Order fulfillment

Inventors: Vivek Farias (Newton, MA); Aryan Iden Khojandi (Cambridge, MA); Ritesh Madan (Berkeley, CA); Chad Yan (Boston, MA); Guang Yang (Beaverton, OR)
Assignee: NIKE, Inc.
G06Q10/087
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,236,395
App. No.
18/238,402
Granted
Feb 25, 2025
Kind
B2
Abstract

Systems and methods for the automated fulfillment of orders from a fulfillment network including consumer-facing retail locations. Orders are partitioned into suborders, which are in turn assigned to retail locations based on forecasted demand for the suborder items at the retail locations. The assignment process considers operational data for each retail location such as the number of employees, the inventory of suborder items, shipping rate cards, return policies, business hours, pick decline estimations, etc.

Claims (35)

1. A system for fulfilling orders from a fulfillment network comprising a plurality of consumer-facing retail locations, the system comprising at least one computer comprising processing circuitry and memory, the memory storing instructions which, when executed by the processing circuitry, cause the processing circuitry to perform operations comprising:

retrieving inventory information for the plurality of retail locations in the fulfillment network;

receiving a customer order for multiple items;

forecasting demand for each of the multiple items in each of the multiple retail locations;

based at least in part on the inventory information and the forecast demand, partitioning the customer order into multiple suborders and assigning the multiple suborders to multiple respective retail locations of the plurality of retail locations for fulfillment, each suborder comprising at least one of the multiple items; and

transmitting each suborder to the selected retail location for fulfillment.

2. The system of claim 1 , wherein assigning the multiple suborders to the respective retail locations comprises solving a linear programming problem.

3. The system of claim 2 , wherein solving the linear programming problem employs a primal-dual approach with constraints comprising retail location inventory.

4. The system of claim 1 , wherein the demand is forecast based on historical data for the plurality of items and the plurality of retail locations.

5. The system of claim 1 , wherein the inventory information is retrieved on a scheduled basis, and wherein forecasting the demand comprises predicting current inventory for each of the multiple items in each of the plurality of retail locations.

6. The system of claim 1 , forecasting the demand comprises balancing inventory across the multiple retail locations to meet expected demand at the multiple retail locations after fulfillment of the suborders.

7. The system of claim 1 , wherein the customer order comprises an address and a deadline for delivery, and wherein the partitioning and assigning are further based on at least one of delivery time or delivery cost.

8. The system of claim 1 , wherein the inventory information is retrieved as part of retrieving operational data, the operational data further comprising at least one of daily sales reports, staffing records, shipping records, shipping rate cards, return policies, business hours, or pick decline estimation.

9. A method, performed by processing circuitry, for fulfilling orders from a fulfillment network comprising a plurality of consumer-facing retail locations, the method comprising:

retrieving inventory information for the plurality of retail locations in the fulfillment network;

receiving a customer order for multiple items;

forecasting demand for each of the multiple items in each of the multiple retail locations;

based at least in part on the inventory information and the forecast demand, partitioning the customer order into multiple suborders and assigning the multiple suborders to multiple respective retail locations of the plurality of retail locations for fulfillment, each suborder comprising at least one of the multiple items; and

transmitting each suborder to the selected retail location for fulfillment.

10. The method of claim 9 , wherein assigning the multiple suborders to the respective retail locations comprises solving a linear programming problem.

11. The method of claim 10 , wherein solving the linear programming problem employs a primal-dual approach with constraints comprising retail location inventory.

12. The method of claim 9 , wherein the demand is forecast based on historical data for the plurality of items and the plurality of retail locations.

13. The method of claim 9 , wherein the inventory information is retrieved on a scheduled basis, and wherein forecasting the demand comprises predicting current inventory for each of the multiple items in each of the plurality of retail locations.

14. The method of claim 9 , forecasting the demand comprises balancing inventory across the multiple retail locations to meet expected demand at the multiple retail locations after fulfillment of the suborders.

15. The method of claim 9 , wherein the customer order comprises an address and a deadline for delivery, and wherein the partitioning and assigning are further based on at least one of delivery time or delivery cost.

16. The method of claim 9 , wherein the inventory information is retrieved as part of retrieving operational data, the operational data further comprising at least one of daily sales reports, staffing records, shipping records, shipping rate cards, return policies, business hours, or pick decline estimation.

17. A non-transitory computer-readable storage medium storing instructions for fulfilling orders from a fulfillment network comprising a plurality of consumer-facing retail locations, the instructions, when executed by processing circuitry, causing the processing circuitry to perform operations comprising:

retrieving inventory information for the plurality of retail locations in the fulfillment network;

receiving a customer order for multiple items;

forecasting demand for each of the multiple items in each of the multiple retail locations;

based at least in part on the inventory information and the forecast demand, partitioning the customer order into multiple suborders and assigning the multiple suborders to multiple respective retail locations of the plurality of retail locations for fulfillment, each suborder comprising at least one of the multiple items; and

transmitting each suborder to the selected retail location for fulfillment.

18. The computer-readable storage medium of claim 17 , wherein assigning the multiple suborders to the respective retail locations comprises solving a linear programming problem.

19. The computer-readable storage medium of claim 17 , wherein the demand is forecast based on historical data for the plurality of items and the plurality of retail locations.

20. The computer-readable storage medium of claim 17 , wherein the inventory information is retrieved on a scheduled basis, and wherein forecasting the demand comprises predicting current inventory for each of the multiple items in each of the plurality of retail locations.

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 5, 2024
From: FARIAS, VIVEK; KHOJANDI, ARYAN IDEN; MADAN, RITESH; YAN, CHAD; YANG, GUANG
To: CELECT, INC.
Reel/Frame 069489/0842 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 5, 2024
From: CELECT, INC.
To: NIKE, INC.
Reel/Frame 069489/0884 →
Continuity (3)
Continuation 17151888 · Jan 19, 2021
Continuation 15980351 · May 15, 2018
Related Publication 20230410039A1 · Dec 21, 2023
References Cited (29)
US 7543743B1 · Yu et al. · 2009 [cited by applicant]
US 7607577B1 · Yu et al. · 2009 [cited by applicant]
US 8352382B1 · Katta et al. · 2013 [cited by applicant]
US 8825798B1 · Johnson et al. · 2014 [cited by applicant]
US 9213953B1 · Kassmann et al. · 2015 [cited by applicant]
US 11126956B2 · Farias · 2021 [cited by examiner]
US 11775927B2 · Farias et al. · 2023 [cited by applicant]
US 20030046173A1 · Benjier et al. · 2003 [cited by applicant]
US 20050197913A1 · Grendel et al. · 2005 [cited by applicant]
US 20060015415A1 · Najmi · 2006 [cited by applicant]
US 20110238461A1 · Mulukutla et al. · 2011 [cited by applicant]
US 20170018013A1 · Faust · 2017 [cited by examiner]
US 20170323250A1 · Lindbo et al. · 2017 [cited by applicant]
US 20190354920A1 · Farias et al. · 2019 [cited by applicant]
US 20200005233A1 · Smith · 2020 [cited by examiner]
US 20210142267A1 · Farias et al. · 2021 [cited by applicant]
US 10,929,809 B2, 02/2021, Farias et al. (withdrawn) [cited by applicant]
“U.S. Appl. No. 15/980,351, Examiner Interview Summary mailed Feb. 28, 2020”, 3 pgs. [cited by applicant]
“U.S. Appl. No. 15/980,351, Final Office Action mailed Jul. 14, 2020”, 12 pgs. [cited by applicant]
“U.S. Appl. No. 15/980,351, Non Final Office Action mailed Jan. 29, 2020”, 12 pgs. [cited by applicant]
“U.S. Appl. No. 15/980,351, Notice of Allowance mailed May 19, 2021”, 9 pgs. [cited by applicant]
“U.S. Appl. No. 15/980,351, Notice of Allowance mailed Oct. 29, 2020”, 9 pgs. [cited by applicant]
“U.S. Appl. No. 15/980,351, Response filed Jun. 23, 2020 to Non Final Office Action mailed Jan. 29, 2020”, 12 pgs. [cited by applicant]
“U.S. Appl. No. 15/980,351, Response filed Sep. 10, 2020 to Final Office Action mailed Jul. 14, 2020”, 9 pgs. [cited by applicant]
“U.S. Appl. No. 17/151,888, Non Final Office Action mailed Feb. 3, 2023”, 11 pgs. [cited by applicant]
“U.S. Appl. No. 17/151,888, Non Final Office Action mailed Sep. 29, 2022”, 18 pgs. [cited by applicant]
“U.S. Appl. No. 17/151,888, Non Final Office Action mailed Dec. 23, 2022”, 11 pgs. [cited by applicant]
“U.S. Appl. No. 17/151,888, Notice of Allowance mailed May 30, 2023”, 9 pgs. [cited by applicant]
“U.S. Appl. No. 17/151,888, Response filed May 3, 2023 to Non Final Office Action mailed Feb. 3, 2023”, 8 pgs. [cited by applicant]