Non-binding placement of inventory in a materials handling facility

Patent metadata

Field	Value
Publication number	US-9818002-B1
Application number	US-39789009-A
Country	US
Kind code	B1
Filing date	Mar 4, 2009
Priority date	Mar 4, 2009
Publication date	Nov 14, 2017
Grant date	Nov 14, 2017

Abstract

In various embodiments, approaches for the placement of inventory in a materials handling facility are described. A virtual representation of a plurality of storage locations in a materials handling facility is maintained in a computer system. Each one of a plurality of inventory items is assigned to a corresponding storage location in the virtual representation. A first portion of the inventory items is stocked, and a second portion of the inventory items is unstocked. Each of the assignments is associated with a profit value. An event related to a change in state of the materials handling facility is input into the computer system. Each one of the second portion of the inventory items is reassigned in the computer system to a corresponding storage location in the virtual representation.

First claim

Therefore, the following is claimed:

1. A method, comprising:
receiving, by at least one computing device, a first event relating to an arrival of a first product to a fulfillment center, the first event generated based at least in part on scanning a first product identifier on the first product using at least one of: an optical scanner or a radiofrequency identifier scanner;
determining, by the at least one computing device, respective capacities of individual ones of a plurality of product storage locations in the fulfillment center;
in response to the first event, executing, by the at least one computing device, an approximation algorithm for solving the generalized assignment problem to determine a first set of optimal assignments of an inventory of products including the first product to the plurality of product storage locations in the fulfillment center, wherein determining the first set of optimal assignments comprises:
maximizing a profit in assigning the inventory of products to the plurality of product storage locations based at least in part on at least one of: a space utilization factor, a picking productivity factor, a global impact factor relative to displacing anticipated unstocked inventory, a stocking productivity factor, or a safety factor;

updating, by the at least one computing device, a data representation of the plurality of product storage locations in the fulfillment center to virtually assign the first product to a first product storage location in the fulfillment center according to the first set of optimal assignments;
receiving, by the at least one computing device, a second event relating to an arrival of a second product to the fulfillment center, the second event generated based at least in part on scanning a second product identifier on the second product using at least one of: the optical scanner or the radiofrequency identifier scanner;
in response to the second event, executing, by the at least one computing device, the approximation algorithm for solving the generalized assignment problem to determine a second set of optimal assignments of the inventory of products including the first product and the second product to the plurality of product storage locations in the fulfillment center, wherein determining the second set of optimal assignments comprises:
maximizing the profit in assigning the inventory of products to the plurality of product storage locations based at least in part on at least one of: the space utilization factor, the picking productivity factor, the global impact factor relative to displacing anticipated unstocked inventory, the stocking productivity factor, or the safety factor;

before the first product is physically stored in the first product storage location, updating, by the at least one computing device, the data representation to virtually reassign the first product from the first product storage location to a second product storage location in the fulfillment center according to the second set of optimal assignments; and
causing, by the at least one computing device, the first product to be physically stored in the second product storage location.

2. The method of claim 1 , further comprising updating, by the at least one computing device, the data representation to virtually assign the second product to the first product storage location in response to the second event.

3. The method of claim 2 , further comprising receiving, by the at least one computing device, a confirmation that the second product has been physically stored in the first product storage location after the second product has been virtually assigned to the first product storage location.

4. The method of claim 1 , further comprising receiving, by the at least one computing device, a confirmation that the first product has been physically stored in the second product storage location after the first product has been virtually reassigned to the second product storage location.

5. The method of claim 1 , wherein the data representation is updated to virtually assign the first product to the first product storage location in the fulfillment center further in response to determining that an assignment of the first product to the first product storage location is associated with a maximum profit value in view of the first event.

6. The method of claim 1 , wherein the data representation is updated to virtually reassign the first product to the second product storage location in the fulfillment center further in response to determining that an assignment of the first product to the second product storage location is associated with a maximum profit value in view of the second event.

7. A system, comprising:
a data store that stores a data representation of a plurality of item storage locations in a materials handling facility; and
at least one computing device in communication with the data store, the at least one computing device being configured to perform a method comprising:
receiving, by the at least one computing device, a first event relating to a movement of a first item en route to or in the materials handling facility, the first event generated based at least in part on scanning a first item identifier on the first item;
determining, by the at least one computing device, respective capacities of individual ones of a plurality of item storage locations in the materials handling facility;
in response to the first event, executing, by the at least one computing device, an approximation algorithm for solving the generalized assignment problem to determine a first set of optimal assignments of an inventory of items including the first item to the plurality of item storage locations in the materials handling facility, wherein determining the first set of optimal assignments further comprises:
maximizing a profit in assigning the inventory of items to the plurality of item storage locations;

updating, by the at least one computing device, the data representation to virtually assign the first item to a first item storage location in the materials handling facility according to the first set of optimal assignments;
receiving, by the at least one computing device, a second event relating to a movement of a second item en route to or in the materials handling facility, the second event generated based at least in part on scanning a second item identifier on the second item;
in response to the second event, executing, by the at least one computing device, the approximation algorithm for solving the generalized assignment problem to determine a second set of optimal assignments of the inventory of items including the first item and the second item to the plurality of item storage locations in the materials handling facility, wherein determining the second set of optimal assignments further comprises:
maximizing the profit in assigning the inventory of items to the plurality of item storage locations;

before the first item is physically stored in the first item storage location, updating, by the at least one computing device, the data representation to virtually reassign the first item from the first item storage location to a second item storage location in the materials handling facility according to the second set of optimal assignments; and
causing, by the at least one computing device, the first item to be physically stored in the second item storage location.

8. The system of claim 7 , wherein the at least one computing device is configured to perform the method further comprising determining, by the at least one computing device, that an assignment of the first item to the first item storage location is associated with a maximum profit value in view of the first event.

9. The system of claim 8

Assignees

• Yunes Jeffrey Michael
• Kudriavstev Alexei A
• Li Xiao Yu
• Nguyen Long X
• Amazon Tech Inc

Inventors

• Yunes Jeffrey Michael
• Kudriavstev Alexei A
• Li Xiao Yu
• Nguyen Long X

Classifications

• G06Q10/00 Primary

  Administration; Management · CPC title

• G06G1/14 Primary

  in which a straight or curved line has to be drawn from given points on one or more input scales to one or more points on a result scale · CPC title

• G06Q10/087

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

• G06Q10/08

  Logistics, e.g. warehousing, loading or distribution; Inventory or stock management · CPC title