CA2863811C - Perpetual batch order fulfillment - Google Patents
Perpetual batch order fulfillment Download PDFInfo
- Publication number
- CA2863811C CA2863811C CA2863811A CA2863811A CA2863811C CA 2863811 C CA2863811 C CA 2863811C CA 2863811 A CA2863811 A CA 2863811A CA 2863811 A CA2863811 A CA 2863811A CA 2863811 C CA2863811 C CA 2863811C
- Authority
- CA
- Canada
- Prior art keywords
- picker
- orders
- order
- new order
- picked
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Economics (AREA)
- Quality & Reliability (AREA)
- Entrepreneurship & Innovation (AREA)
- Human Resources & Organizations (AREA)
- Marketing (AREA)
- Operations Research (AREA)
- Development Economics (AREA)
- Strategic Management (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Warehouses Or Storage Devices (AREA)
Abstract
A method of batch order fulfillment includes assigning a plurality of orders to a picker. Each order includes multiple units to be picked, and the picker picks the units in a logical travel sequence that generally minimizes a travel time of the picker. The method further includes assigning a new order comprising multiple units to be picked to the picker after one of the previously assigned orders is completed. The picker picks the units of the new order and unpicked units of the previously assigned orders in logical travel sequences that generally minimizes a travel time of the picker.
Description
PERPETUAL BATCH ORDER FULFILLMENT
[0001] <<This paragraph has been left intentionally blank.>>
BACKGROUND OF THE INVENTION
Field of the Invention
[0001] <<This paragraph has been left intentionally blank.>>
BACKGROUND OF THE INVENTION
Field of the Invention
[0002] The present invention relates to a method and system of batch order fulfillment, and a computer usable medium having a computer readable program code embodied therein adapted to be executed to implement the method of batch order fulfillment.
Description of Related Art
Description of Related Art
[0003] Batch picking is picking multiple orders at a time. In one method of batch picking, as described in U.S. Patent No. 5,812,986, an RF Cart allows a picker to pick multiple orders at a time while pushing a mobile cart through a warehouse. The cart directs the picker where to go and what to pick in a logical walk sequence.
[0004] Typically, with an RF Cart, multiple orders "N" are assigned to a cart, each order at its own unique location on the cart. The controller (processor or computer) electronically joins the orders together, making them one larger order, referred to in the industry as a "batch". The basis of the batch picking concept is to enable a single picker to pick multiple orders while only walking the distance of a pick line once, thereby improving efficiency.
[0005] In conventional batch picking methodology, "N" orders are assigned to a cart as a batch, and then a picker walks a pick line, picking items as directed by the cart in a walk sequence. After the length of the pick line is completed, "N" orders are completed. With this methodology, the pick line has a starting point and an end point. The process begins at the starting point with "N" empty (unfulfilled) orders and ends at the end point, which is commonly coincident with the start point, with "N" orders completed. It is then emptied and reloaded with "N" new orders and the process is repeated.
[0006] The above process is enhanced by locating warehouse items (SKUs) based on their pick volume. Placing the most commonly picked items near the beginning of the pick line provides the potential that the "N" orders are completed prior to walking the entire pick path, thereby allowing the picker to take a shortcut back to the starting point.
However, the process of locating high volume items to the front of the line is time consuming and labor intensive, and warehouse managers struggle with moving stock around to maintain efficient product placement.
SUMMARY OF THE INVENTION
However, the process of locating high volume items to the front of the line is time consuming and labor intensive, and warehouse managers struggle with moving stock around to maintain efficient product placement.
SUMMARY OF THE INVENTION
[0007] A method of batch order fulfillment of the present invention includes:
assigning a plurality of orders to a picker, each order comprising multiple units to be picked, wherein the picker picks the units in a logical travel sequence that generally minimizes a travel time of the picker; and assigning a new order comprising multiple units to be picked to the picker after one of the previously assigned orders is completed, wherein the picker picks the units of the new order and unpicked units of the previously assigned orders in logical travel sequences that generally minimizes a travel time of the picker.
assigning a plurality of orders to a picker, each order comprising multiple units to be picked, wherein the picker picks the units in a logical travel sequence that generally minimizes a travel time of the picker; and assigning a new order comprising multiple units to be picked to the picker after one of the previously assigned orders is completed, wherein the picker picks the units of the new order and unpicked units of the previously assigned orders in logical travel sequences that generally minimizes a travel time of the picker.
[0008] The step of assigning a new order may be repeated.
[0009] The method may further include assigning one or more single unit orders to the picker.
[0010] The picker may be a mobile picking cart that has a designated location for each order. The completed order may be removed from its designated location and replaced by the new order. The mobile picking car may also have a designated location for one or more single unit orders.
[0011] The new order may be chosen from the plurality of available orders to be picked based on an increase in the picker's travel time resulting from assigning the new order to the picker.
[0012] A system of batch order fulfillment of the present invention includes:
a guidance system that directs a picker to items to be picked in a logical travel sequence that generally minimizes a travel time of the picker, wherein the items to be picked are from a plurality of orders assigned to a picker, each order comprising multiple items to be picked; and an assigning system that assigns a new order comprising multiple items to be picked to the picker after one of the previously assigned orders is completed.
a guidance system that directs a picker to items to be picked in a logical travel sequence that generally minimizes a travel time of the picker, wherein the items to be picked are from a plurality of orders assigned to a picker, each order comprising multiple items to be picked; and an assigning system that assigns a new order comprising multiple items to be picked to the picker after one of the previously assigned orders is completed.
[0013] The assigning system may also assign one or more single unit orders to the picker.
[0014] The system may also include a mobile picking cart that has a designated location for each order. The mobile picking cart may have a designated location for one or more single unit orders.
[0015] The assigning system may choose a new order from the plurality of available orders to be picked based on an increase in the picker's travel time resulting from assigning the new order to the picker.
[0016] A computer usable medium of the present invention has a computer readable program code embodied therein, said computer readable program code adapted to be executed to implement a method of batch order fulfillment, the method comprising: assigning a plurality of orders to a picker, each order comprising multiple units to be picked, wherein the picker picks the units in a logical travel sequence that generally minimizes a travel time of the picker; and assigning a new order comprising multiple units to be picked to the picker after one of the previously assigned orders is completed, wherein the picker picks the units of the new order and unpicked units of the previously assigned orders in logical travel sequences that generally minimizes a travel time of the picker.
[0017] The method may include repeating the step of assigning a new order.
[0018] The method may include assigning one or more single unit orders to the picker.
[0019] The method may include choosing the new order from the plurality of available orders to be picked based on an increase in the picker's travel time resulting from assigning the new order to the picker.
BRIEF DESCRIPTION OF THE DRAWINGS
BRIEF DESCRIPTION OF THE DRAWINGS
[0020] FIGS. 1A and 1B illustrate a method of batch order fulfillment representative of the related art.
[0021] FIGS. 2A-2E illustrate a method of batch order fulfillment according to an embodiment of the present invention.
DETAILED DESCRIPTION OF THE INVENTION
DETAILED DESCRIPTION OF THE INVENTION
[0022] FIGS. 1A and 1B illustrate a method of batch order fulfillment representative of the related art. In FIG. 1A, a picker 10 is assigned first, second and third orders, each order including multiple units to be picked. From the starting point, the picker picks the units to be picked by travelling along the pick path to the end point of the pick path, thereby completing the first, second and third orders. The process of FIG. 1A is then repeated in FIG. 1B with the picker being assigned three new orders, i.e., fourth, fifth and sixth orders. From the starting point, the picker picks the units to be picked by travelling along the pick path to the end point of the pick path, thereby completing the fourth, fifth and sixth orders. At the end of two complete cycles of picking, the picker is able to complete six orders after walking two times around the pick path.
[0023] The inefficiency of this methodology is evident by the fact that orders are completed at varying points along the pick path, and, as orders arc completed, the picker becomes progressively less efficient. If a picker starts with "N" orders and progresses along a route eventually completing one of the orders, the batch now becomes a batch of only N-1 orders. This degradation of picker efficiency continues until the batch becomes only 1 remaining order with remaining units to be picked. Thus, at the end of one walk through the pick path, the picker only picked "N" orders.
[0024] FIGS. 2A-E illustrate a method of batch order fulfillment according to an embodiment of the present invention. In FIG. 2A, a picker 20 is assigned first, second and third orders, each order including multiple units to be picked. From the starting point, the picker picks the units to be picked by travelling along the pick path until one of the orders is completed. In this case, the third order is completed when an item is picked from Bin 53. At this time, the picker 20 is assigned a new order, i.e., the fourth order, and continues travelling along the picking path while picking the first, second and fourth orders as shown in FIG. 2B
until one of the orders is completed. In this case, the first order is completed when an item is picked from Bin 63. At this time, the picker 20 is assigned another new order, i.e., the fifth order, and continues travelling along the picking path while picking the second, fourth and fifth orders as shown in FIG. 2C until one of the orders is completed. In this case, the second order is completed when an item is picked from Bin 62. At this time, the picker 20 is assigned another new order, i.e., the sixth order, and continues travelling along the picking path while picking the fourth, fifth and sixth orders as shown in FIG. 2D
until one of the orders is completed. In this case, the fourth order is completed when an item is picked from Bin 12. At this time, the picker 20 is assigned another new order, i.e., the seventh order, and continues travelling along the picking path while picking the fifth, sixth and seventh orders as shown in FIG. 2E. It is already evident that at the end of two complete cycles, the picker is able to complete at least seven orders after walking two times around the pick path.
until one of the orders is completed. In this case, the first order is completed when an item is picked from Bin 63. At this time, the picker 20 is assigned another new order, i.e., the fifth order, and continues travelling along the picking path while picking the second, fourth and fifth orders as shown in FIG. 2C until one of the orders is completed. In this case, the second order is completed when an item is picked from Bin 62. At this time, the picker 20 is assigned another new order, i.e., the sixth order, and continues travelling along the picking path while picking the fourth, fifth and sixth orders as shown in FIG. 2D
until one of the orders is completed. In this case, the fourth order is completed when an item is picked from Bin 12. At this time, the picker 20 is assigned another new order, i.e., the seventh order, and continues travelling along the picking path while picking the fifth, sixth and seventh orders as shown in FIG. 2E. It is already evident that at the end of two complete cycles, the picker is able to complete at least seven orders after walking two times around the pick path.
[0025] The improved efficiency of the methodology of FIGS. 2A-2E is evident by the fact that although orders are completed at varying points along the pick path, new orders are assigned, and the picker maintains efficiency. With this "perpetual batch"
methodology, the same picker can complete more orders while walking the same distance.
methodology, the same picker can complete more orders while walking the same distance.
[0026] It will be understood that the above described method is one exemplary embodiment and that the method of batch order fulfillment may include variations from the above description as well as additional features, some of which are described below.
[0027] The example of FIGS. 2A-2E shows the first, second and third orders to be added to the cart, such that the third order is completed before the first and second orders are completed. However, according to a preferred embodiment of the present invention, the first order would be completed before the second order is completed, which is completed before the third order is completed.
[0028] To understand why the orders would be completed in the order of assignment for the preferred embodiment, it is helpful to understand a certain philosophy. In particular, a pick line, which usually includes multiple aisles (as is adequately shown in the Figures), can be exploded into a virtual "circle". The pick line represents a pick path that ends where it begins, and thus the pick line can be exploded into a theoretical "circle".
Each pick location in the pick line can then be represented in degrees or radians on a circle of circumference "C", where "C" represents the distance required to travel the entire pick path. Each location represents a specific angle on this circle. The distance between pick locations can be represented by the difference between the current location angle on the "circle" and the "angle" of the pick location(s). At the beginning, when no orders are assigned to a batch, the system reviews every order in a queue of pending orders, and determines a distance factor based on the current location of the batch cart. This distance factor represents the distance along the pick path required to complete the order from the current location on the pick path.
The order with the lowest distance factor is then added to the batch. In the case of an empty cart, the "N" orders with the smallest distance factor are added to the batch, based on their rankings shortest to longest. Thus, the first order would be the order with the smallest distance to travel from the current location and thus would be the first order to be completed.
Thus the third order would not be completed before first order. It should also be noted that the direction of movement around the pick "circle" is always the same direction. No orders are selected that require the picker to move backward on the pick path.
Each pick location in the pick line can then be represented in degrees or radians on a circle of circumference "C", where "C" represents the distance required to travel the entire pick path. Each location represents a specific angle on this circle. The distance between pick locations can be represented by the difference between the current location angle on the "circle" and the "angle" of the pick location(s). At the beginning, when no orders are assigned to a batch, the system reviews every order in a queue of pending orders, and determines a distance factor based on the current location of the batch cart. This distance factor represents the distance along the pick path required to complete the order from the current location on the pick path.
The order with the lowest distance factor is then added to the batch. In the case of an empty cart, the "N" orders with the smallest distance factor are added to the batch, based on their rankings shortest to longest. Thus, the first order would be the order with the smallest distance to travel from the current location and thus would be the first order to be completed.
Thus the third order would not be completed before first order. It should also be noted that the direction of movement around the pick "circle" is always the same direction. No orders are selected that require the picker to move backward on the pick path.
[0029] Once the cart is in normal operation, and new orders are being assigned to the batch, it is possible for newly added order(s) to completed earlier than older orders already assigned. This case exists when the pending pool of orders is dynamically changing based on orders being received from customer throughout the day. Thus the pending pool is dynamic, not a fixed order queue.
[0030] In one embodiment, the picker may be a mobile picking cart that has a designated location for each order. For instance, the cart may have only "N" designated locations for holding orders. According to the method of FIGS. 1A-1B, the cart is used inefficiently as orders are completed, and the cart become less efficient. If the cart starts with "N" assigned orders and progresses along a route eventually completing one of the orders, the batch assigned to the cart now becomes a batch of only N-1 orders. This degradation of cart efficiency continues until the batch becomes only one remaining order with units to be picked. Thus, at the end of one walk through the pick path, the cart only picked "N" orders.
However, with the "perpetual batch" methodology, the same cart with "N"
locations can complete many more than "N" orders while travelling the same distance.
However, with the "perpetual batch" methodology, the same cart with "N"
locations can complete many more than "N" orders while travelling the same distance.
[0031] Also, the mobile picking cart may be a RF cart. The RF cart is a paperless order fulfillment system that utilizes hardware mounted to a mobile cart. The RF
carts provide a method of picking multiple orders at a time on a single pass through the warehouse, making order pickers more accurate and productive. The RF carts are computer controlled and communicate with a centralized computer system via a RF network, providing real-time response and reporting. The system directs pickers to warehouse pick locations in the most efficient route, minimizing walk distance while fulfilling multiple orders at once. However, the RF Cart is merely one exemplary mobile picking cart used in the method of batch picking. This method can apply to any operation that batch picks orders, regardless if the RF
cart is being utilized. This could be utilized with RF Terminals, Voice recognition, or pick sleds (basically RF Carts without wheels that travel on a conveyor adjacent to pick locations).
carts provide a method of picking multiple orders at a time on a single pass through the warehouse, making order pickers more accurate and productive. The RF carts are computer controlled and communicate with a centralized computer system via a RF network, providing real-time response and reporting. The system directs pickers to warehouse pick locations in the most efficient route, minimizing walk distance while fulfilling multiple orders at once. However, the RF Cart is merely one exemplary mobile picking cart used in the method of batch picking. This method can apply to any operation that batch picks orders, regardless if the RF
cart is being utilized. This could be utilized with RF Terminals, Voice recognition, or pick sleds (basically RF Carts without wheels that travel on a conveyor adjacent to pick locations).
[0032] In one aspect, there is a system of batch order fulfillment in order to achieve the above-described method. This system may include a guidance system and an assigning system, which may be integrated together or separate. The guidance system directs the picker to items to be picked in a logical travel sequence that generally minimizes a travel time of the picker. The assigning system assigns a new order comprising multiple items to be picked to the picker after one of the previously assigned orders is completed. The guidance system may include a system for directing the picker, for example, audibly or visually, or may include a system for controlling the movement of a vehicle or cart associated with the picker.
The assigning system may include a computer system or other controller that assigned new orders to the picker from a plurality of available orders to be picked. The computer system or controller may be separated from but in communication with the picker, or the computer system may travelling along with the picker as part of the cart or vehicle.
100331 In another aspect, there may be a computer usable medium having a computer readable program code embodied therein that is adapted to be executed to implement the method of batch order fulfillment. With this aspect, software controlling the picking process creates a batch. Although the orders to be assigned may be chosen randomly or by using commonality algorithms, it is preferred that the orders to be assigned are chosen based on an increase in the picker's travel time resulting from assigning the new order to the picker, or may be chosen based on the minimum travel distance or time from the current point on the pick path. In this case, the software may assign orders to the picker or cart based on finding orders that can be completed with the minimum amount of travel from the current cart position or from the last picked item position.
[0034] Additionally, in another aspect, there is no dedicated start point or endpoint. In this case, a plurality of carts or pickers may be scattered randomly throughout a pick line. This distribution of the carts or pickers avoids collision and passing requirements necessitated when multiple pickers are traversing a pick line simultaneously.
[0035] In the case of multiple carts, at the beginning of the picking process, for each cart in the system, the software selects "N" orders corresponding to the number of order locations on the cart, based on the "N" orders that can be completed in the shortest travel distance or shortest travel time. The picker completes picks until he/she reaches a point where an order completes. The order may be removed and placed in a completed order queue, either on the cart, or on a conveyor that transports the order to a shipping area. The software may then determine, from all available orders, which order can be assigned to the freed location on the cart that can be completed in the least travel distance or least travel time.
That order is assigned to the freed location and picking continues. The process of replacing completed orders with new orders that can be picked with least travel continues indefinitely, until all orders are completed.
[0036] Also, it is possible that an order can be chosen for assignment other than shortest travel distance or shortest travel time. However, it is generally understood by the inventor that the pick time will generally be minimized and that the number of orders completed per "revolution" of the pick circle exists when the order added to the batch is completed with the shorted distance. Other batch optimization techniques exist that select orders based on commonality, where rather than selecting orders based on distance to complete, orders are selected based on having common items (SKUs). According to simulation analysis, minimizing the distance to complete an order provides the best efficiency, but the present invention is not be limited to that selection method.
[0037] A benefit of the above described embodiments is that "N" location carts are always picking "N" orders at a time. This provides much greater efficiency than the conventional method where the carts progressively get less efficient as the batch size decreases as orders are completed.
[0038] Another benefit of the above-described embodiments is that the methodology thrives on randomness of item location in a warehouse. Having high volume items randomly scattered throughout a pick line actually makes this system more efficient, as there is no start and endpoint. This relieves the warehouse manager of many SKU management tasks along with the associated labor and downtime associated with moving items around.
[0039] Another feature is the potential to handle "Single Unit Orders". In many direct to consumer order fulfillment operations, the order quantity is often a single unit. The perpetual batch methodology can implement the ability to pick single unit orders. For instance, a single, preferably larger, order location on the batch cart can be dedicated to receive single unit orders. Any order in the system that is a single unit can be dynamically assigned to each individual batch if that item resides between the current location on the pick path and the next batch pick location. Thus, any single unit order is not available for inclusion in batches.
These orders are added to any batch cart that happens to be passing the warehouse location.
When the single unit order location on the cart fills, it is removed and sent to a secondary processing station where each item is removed and assigned to an order dynamically. As each of these orders is completed as a single unit, no order integrity is required until it arrives at the secondary processing (shipping) station.
[0040] To provide a further description of single unit order shipping, basically, a bin, box, or other storage medium containing batch picked single unit orders is removed from a cart and delivered to a shipping station. This station is typically equipped with a computer, monitor (often touch screen), bar code scanner, label printer, and a scale.
Since every item in the tote represents a unique and individual order, each item is a shipment in itself. The operator at the shipping station typically removes an item from the container, scans an identifying bar code on the product, places the item into a shipping container or envelope, and places the item on a scale. The software finds a pending (queued) order that required only that item (SKU) from its database, calculates shipping based on the delivery address and weight, and prints both a shipping label and a packing slip for that order.
This process continues for each item in the container.
[0041] It will be understood by those skilled in the art that the word "walking" or "walk" is used because many picking operations include carts that are pushed through a pick line manually, and hence, the picker is walking. The present invention is not limited to circumstances where carts are used or where walking is required. The present invention applies to any situation that utilizes any form of batch picking, whether automated or manual.
Also, the present invention is not limited to the use of batch pick carts, which were chosen for describing the process as it is a common implementation of this technology.
For example, a conveyor, automatic guided vehicle, conveyed sled, or other method of transportation other than walking could be utilized.
[0042] Although the invention has been described in detail for the purpose of illustration based on what is currently considered to be the most practical and preferred embodiments, it is to be understood that such detail is solely for that purpose and that the invention is not limited to the disclosed embodiments, but, on the contrary, is intended to cover modifications and equivalent arrangements. For example, it is to be understood that the present invention contemplates that, to the extent possible, one or more features of any embodiment can be combined with one or more features of any other embodiment.
The assigning system may include a computer system or other controller that assigned new orders to the picker from a plurality of available orders to be picked. The computer system or controller may be separated from but in communication with the picker, or the computer system may travelling along with the picker as part of the cart or vehicle.
100331 In another aspect, there may be a computer usable medium having a computer readable program code embodied therein that is adapted to be executed to implement the method of batch order fulfillment. With this aspect, software controlling the picking process creates a batch. Although the orders to be assigned may be chosen randomly or by using commonality algorithms, it is preferred that the orders to be assigned are chosen based on an increase in the picker's travel time resulting from assigning the new order to the picker, or may be chosen based on the minimum travel distance or time from the current point on the pick path. In this case, the software may assign orders to the picker or cart based on finding orders that can be completed with the minimum amount of travel from the current cart position or from the last picked item position.
[0034] Additionally, in another aspect, there is no dedicated start point or endpoint. In this case, a plurality of carts or pickers may be scattered randomly throughout a pick line. This distribution of the carts or pickers avoids collision and passing requirements necessitated when multiple pickers are traversing a pick line simultaneously.
[0035] In the case of multiple carts, at the beginning of the picking process, for each cart in the system, the software selects "N" orders corresponding to the number of order locations on the cart, based on the "N" orders that can be completed in the shortest travel distance or shortest travel time. The picker completes picks until he/she reaches a point where an order completes. The order may be removed and placed in a completed order queue, either on the cart, or on a conveyor that transports the order to a shipping area. The software may then determine, from all available orders, which order can be assigned to the freed location on the cart that can be completed in the least travel distance or least travel time.
That order is assigned to the freed location and picking continues. The process of replacing completed orders with new orders that can be picked with least travel continues indefinitely, until all orders are completed.
[0036] Also, it is possible that an order can be chosen for assignment other than shortest travel distance or shortest travel time. However, it is generally understood by the inventor that the pick time will generally be minimized and that the number of orders completed per "revolution" of the pick circle exists when the order added to the batch is completed with the shorted distance. Other batch optimization techniques exist that select orders based on commonality, where rather than selecting orders based on distance to complete, orders are selected based on having common items (SKUs). According to simulation analysis, minimizing the distance to complete an order provides the best efficiency, but the present invention is not be limited to that selection method.
[0037] A benefit of the above described embodiments is that "N" location carts are always picking "N" orders at a time. This provides much greater efficiency than the conventional method where the carts progressively get less efficient as the batch size decreases as orders are completed.
[0038] Another benefit of the above-described embodiments is that the methodology thrives on randomness of item location in a warehouse. Having high volume items randomly scattered throughout a pick line actually makes this system more efficient, as there is no start and endpoint. This relieves the warehouse manager of many SKU management tasks along with the associated labor and downtime associated with moving items around.
[0039] Another feature is the potential to handle "Single Unit Orders". In many direct to consumer order fulfillment operations, the order quantity is often a single unit. The perpetual batch methodology can implement the ability to pick single unit orders. For instance, a single, preferably larger, order location on the batch cart can be dedicated to receive single unit orders. Any order in the system that is a single unit can be dynamically assigned to each individual batch if that item resides between the current location on the pick path and the next batch pick location. Thus, any single unit order is not available for inclusion in batches.
These orders are added to any batch cart that happens to be passing the warehouse location.
When the single unit order location on the cart fills, it is removed and sent to a secondary processing station where each item is removed and assigned to an order dynamically. As each of these orders is completed as a single unit, no order integrity is required until it arrives at the secondary processing (shipping) station.
[0040] To provide a further description of single unit order shipping, basically, a bin, box, or other storage medium containing batch picked single unit orders is removed from a cart and delivered to a shipping station. This station is typically equipped with a computer, monitor (often touch screen), bar code scanner, label printer, and a scale.
Since every item in the tote represents a unique and individual order, each item is a shipment in itself. The operator at the shipping station typically removes an item from the container, scans an identifying bar code on the product, places the item into a shipping container or envelope, and places the item on a scale. The software finds a pending (queued) order that required only that item (SKU) from its database, calculates shipping based on the delivery address and weight, and prints both a shipping label and a packing slip for that order.
This process continues for each item in the container.
[0041] It will be understood by those skilled in the art that the word "walking" or "walk" is used because many picking operations include carts that are pushed through a pick line manually, and hence, the picker is walking. The present invention is not limited to circumstances where carts are used or where walking is required. The present invention applies to any situation that utilizes any form of batch picking, whether automated or manual.
Also, the present invention is not limited to the use of batch pick carts, which were chosen for describing the process as it is a common implementation of this technology.
For example, a conveyor, automatic guided vehicle, conveyed sled, or other method of transportation other than walking could be utilized.
[0042] Although the invention has been described in detail for the purpose of illustration based on what is currently considered to be the most practical and preferred embodiments, it is to be understood that such detail is solely for that purpose and that the invention is not limited to the disclosed embodiments, but, on the contrary, is intended to cover modifications and equivalent arrangements. For example, it is to be understood that the present invention contemplates that, to the extent possible, one or more features of any embodiment can be combined with one or more features of any other embodiment.
Claims (16)
1. A computer-implemented method of batch order fulfillment executed by one or more processors, the method comprising:
assigning a plurality of orders to a picker, each order comprising multiple units to be picked, wherein the picker picks the units in a logical travel sequence that generally minimizes a travel time of the picker;
upon receiving an indication that one of the assigned orders is complete, selecting a new order for the picker, wherein selecting the new order comprises:
determining a location of a last unit picked by the picker, determining a travel distance for each of one or more available orders based upon the location of the last unit picked, determining a travel time for each available order based upon an increase in travel time for the picker to complete the available order, choosing the new order from the one or more available orders based on at least one of the travel distance and the travel time for the new order; and updating a logical travel sequence for the picker to include picking units for the new order in a sequence that minimizes the increase in travel time; and assigning the new order comprising multiple units to be picked to the picker after one of the previously assigned orders is completed, wherein the picker picks the units of the new order and unpicked units of the previously assigned orders, which have not been completed, following the updated logical travel sequence to minimize the travel time of the picker.
assigning a plurality of orders to a picker, each order comprising multiple units to be picked, wherein the picker picks the units in a logical travel sequence that generally minimizes a travel time of the picker;
upon receiving an indication that one of the assigned orders is complete, selecting a new order for the picker, wherein selecting the new order comprises:
determining a location of a last unit picked by the picker, determining a travel distance for each of one or more available orders based upon the location of the last unit picked, determining a travel time for each available order based upon an increase in travel time for the picker to complete the available order, choosing the new order from the one or more available orders based on at least one of the travel distance and the travel time for the new order; and updating a logical travel sequence for the picker to include picking units for the new order in a sequence that minimizes the increase in travel time; and assigning the new order comprising multiple units to be picked to the picker after one of the previously assigned orders is completed, wherein the picker picks the units of the new order and unpicked units of the previously assigned orders, which have not been completed, following the updated logical travel sequence to minimize the travel time of the picker.
2. The method of claim 1, wherein selecting the new order further comprises repeating the step of assigning the new order.
3. The method of claim 1, further comprising assigning one or more single unit orders to the picker.
4. The method of claim 1, wherein the picker is a mobile picking cart that has a designated location for each order.
5. The method of claim 4, wherein the completed order is removed from its designated location and replaced by the new order.
Date Recue/Date Received 2021-06-09
Date Recue/Date Received 2021-06-09
6. The method of claim 4, wherein the mobile picking cart has a designated location for one or more single unit orders.
7. The method of claim 1, wherein the new order is chosen from a plurality of available orders to be picked based on an increase in the picker's travel time resulting from assigning the new order to the picker.
8. A system of batch order fulfillment, the system comprising:
a computerized guidance system in communication with a picker that directs the picker to units to be picked in a logical travel sequence that generally minimizes a travel time of the picker, wherein the units to be picked are from a plurality of orders assigned to the picker, each order comprising multiple units to be picked; and a computerized assigning system that is configured to:
select a new order comprising multiple units to be picked for the picker, wherein selecting the new order comprises:
determining a location of a last unit picked by the picker based upon location information received from the computerized guidance system, determining a travel distance for each of one or more available orders based upon the location of the last unit picked, determining a travel time for each available order based upon an increase in travel time for the picker to complete the available order, choosing the new order from the one or more available orders based on at least one of the travel distance and the travel time for the new order, and updating the logical travel sequence for the picker to include picking units for the new order in a sequence that minimizes the increase in travel time; and assign the new order comprising multiple units to be picked to the picker after one of the previously assigned orders is completed such that the picker picks the units of the new order and unpicked units of the previously assigned orders, which have not been completed, following the updated logical travel sequence to minimize the travel time of the picker.
a computerized guidance system in communication with a picker that directs the picker to units to be picked in a logical travel sequence that generally minimizes a travel time of the picker, wherein the units to be picked are from a plurality of orders assigned to the picker, each order comprising multiple units to be picked; and a computerized assigning system that is configured to:
select a new order comprising multiple units to be picked for the picker, wherein selecting the new order comprises:
determining a location of a last unit picked by the picker based upon location information received from the computerized guidance system, determining a travel distance for each of one or more available orders based upon the location of the last unit picked, determining a travel time for each available order based upon an increase in travel time for the picker to complete the available order, choosing the new order from the one or more available orders based on at least one of the travel distance and the travel time for the new order, and updating the logical travel sequence for the picker to include picking units for the new order in a sequence that minimizes the increase in travel time; and assign the new order comprising multiple units to be picked to the picker after one of the previously assigned orders is completed such that the picker picks the units of the new order and unpicked units of the previously assigned orders, which have not been completed, following the updated logical travel sequence to minimize the travel time of the picker.
9. The system of claim 8, wherein the assigning system assigns one or more single Date Recue/Date Received 2021-06-09 unit orders to the picker.
10. The system of claim 8, wherein the picker comprises a mobile picking cart that has a designated location for each order.
11. The system of claim 10, wherein the mobile picking cart has a designated location for one or more single unit orders.
12. The system of claim 8, wherein the assigning system chooses the new order from a plurality of available orders to be picked based on an increase in the picker's travel time resulting from assigning the new order to the picker.
13. A computer usable medium having a computer readable program code embodied therein, said computer readable program code adapted to be executed to implement a method of batch order fulfillment, the method comprising:
assigning a plurality of orders to a picker, each order comprising multiple units to be picked, wherein the picker picks the units in a logical travel sequence that generally minimizes a travel time of the picker;
selecting a new order comprising multiple units to be picked for the picker, wherein selecting the new order comprises:
determining a location of a last unit picked by the picker based upon location information received from a computerized guidance system, determining a travel distance for each of the one or more available orders based upon the location of the last unit picked, determining a travel time for each available order based upon an increase in travel time for the picker to complete the available order, choosing the new order from the one or more available orders based on at least one of the travel distance and the travel time for the new order, and updating the logical travel sequence for the picker to include picking units for the new order in a sequence that minimizes the increase in travel time; and assigning the new order comprising multiple units to be picked to the picker after one of the previously assigned orders is completed, wherein the picker picks the units of the new order and unpicked units of the previously assigned orders following the updated logical travel Date Recue/Date Received 2021-06-09 sequence to minimize the travel time of the picker.
assigning a plurality of orders to a picker, each order comprising multiple units to be picked, wherein the picker picks the units in a logical travel sequence that generally minimizes a travel time of the picker;
selecting a new order comprising multiple units to be picked for the picker, wherein selecting the new order comprises:
determining a location of a last unit picked by the picker based upon location information received from a computerized guidance system, determining a travel distance for each of the one or more available orders based upon the location of the last unit picked, determining a travel time for each available order based upon an increase in travel time for the picker to complete the available order, choosing the new order from the one or more available orders based on at least one of the travel distance and the travel time for the new order, and updating the logical travel sequence for the picker to include picking units for the new order in a sequence that minimizes the increase in travel time; and assigning the new order comprising multiple units to be picked to the picker after one of the previously assigned orders is completed, wherein the picker picks the units of the new order and unpicked units of the previously assigned orders following the updated logical travel Date Recue/Date Received 2021-06-09 sequence to minimize the travel time of the picker.
14. The computer usable medium of claim 13, wherein the method includes repeating the step of assigning the new order.
15. The computer usable medium of claim 13, wherein the method includes assigning one or more single unit orders to the picker.
16. The computer usable medium of claim 13, wherein the method includes choosing the new order from a plurality of available orders to be picked based on an increase in the picker's travel time resulting from assigning the new order to the picker.
Date Recue/Date Received 2021-06-09
Date Recue/Date Received 2021-06-09
Applications Claiming Priority (3)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| US201261595095P | 2012-02-05 | 2012-02-05 | |
| US61/595,095 | 2012-02-05 | ||
| PCT/US2013/024308 WO2013116620A1 (en) | 2012-02-05 | 2013-02-01 | Perpetual batch order fulfillment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CA2863811A1 CA2863811A1 (en) | 2013-08-08 |
| CA2863811C true CA2863811C (en) | 2022-07-26 |
Family
ID=48905865
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CA2863811A Active CA2863811C (en) | 2012-02-05 | 2013-02-01 | Perpetual batch order fulfillment |
Country Status (6)
| Country | Link |
|---|---|
| EP (1) | EP2810225A4 (en) |
| JP (3) | JP6258870B2 (en) |
| CN (2) | CN104205135B (en) |
| CA (1) | CA2863811C (en) |
| HK (1) | HK1202957A1 (en) |
| WO (1) | WO2013116620A1 (en) |
Families Citing this family (25)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20120024669A1 (en) | 2010-07-29 | 2012-02-02 | Danelski Darin L | Networked Motorized Drive Roller Conveyor |
| SG11201402580SA (en) | 2011-11-24 | 2014-10-30 | Indian Inst Technology | Multilayer organic-templated-boehmite-nanoarchitecture for water purification |
| CN104205135B (en) * | 2012-02-05 | 2018-06-19 | 麦修斯资源有限公司 | Order is persistently criticized to fulfil |
| US9446908B2 (en) | 2012-02-05 | 2016-09-20 | Matthews Resources, Inc. | Conveying systems and methods of associating data with an item transported by a conveying system |
| US10229383B2 (en) | 2012-02-05 | 2019-03-12 | Matthews International Corporation | Perpetual batch order fulfillment |
| WO2013156870A2 (en) | 2012-04-17 | 2013-10-24 | Indian Institute Of Technology | Detection of quantity of water flow using quantum clusters |
| US9626714B2 (en) | 2014-07-23 | 2017-04-18 | Dematic Corp. | Laser mobile put wall |
| CN105035614A (en) * | 2015-06-30 | 2015-11-11 | 贵州慧联科技有限公司 | Multi-order parallel electronic-label picking production line without order plate, and picking method of multi-order parallel electronic-label picking production line |
| CN105354641B (en) * | 2015-11-12 | 2021-08-17 | 北京京东尚科信息技术有限公司 | Goods picking path optimization method and goods picking path optimization device |
| US10001768B2 (en) * | 2016-09-01 | 2018-06-19 | Locus Robotics Corp. | Item storage array for mobile base in robot assisted order-fulfillment operations |
| CN108122082A (en) * | 2016-11-29 | 2018-06-05 | 杭州海康机器人技术有限公司 | A kind of warehouse-out method and device |
| KR101931342B1 (en) * | 2016-12-22 | 2018-12-20 | 쿠팡 주식회사 | Device, method, and computer program for grouping products bundle |
| CN106628447A (en) * | 2017-01-06 | 2017-05-10 | 统杰图文（昆山）有限公司 | Multi-storefront cargo-allocation technology mode |
| CN108357886A (en) * | 2017-01-26 | 2018-08-03 | 菜鸟智能物流控股有限公司 | Item sorting method and related apparatus |
| CN108694637B (en) * | 2017-04-10 | 2022-01-07 | 北京京东尚科信息技术有限公司 | Order processing method, device, server and storage medium |
| CN109647719B (en) * | 2017-10-11 | 2020-07-31 | 北京京东振世信息技术有限公司 | Method and device for sorting goods |
| US11074547B2 (en) | 2018-04-20 | 2021-07-27 | Walmart Apollo, Llc | Systems and methods for dual optimization of pick walk and tote fill rates for order picking |
| CN110580593B (en) * | 2018-06-08 | 2022-07-05 | 北京京东乾石科技有限公司 | Goods sorting method, control system and goods sorting system |
| JP7279876B2 (en) * | 2018-12-10 | 2023-05-23 | 国立大学法人秋田大学 | Picking work support system and its program |
| US11034027B2 (en) * | 2019-02-01 | 2021-06-15 | Locus Robotics Corp. | Robot assisted personnel routing |
| CN110111050A (en) * | 2019-05-05 | 2019-08-09 | 武汉科技大学 | Order allocation method and its distribution system |
| CN113762570B (en) * | 2020-10-22 | 2024-05-24 | 北京京东振世信息技术有限公司 | Method and device for sorting task group list |
| CN117043798A (en) * | 2020-11-06 | 2023-11-10 | 富士通株式会社 | Information processing device, search method, and search program |
| WO2024089782A1 (en) * | 2022-10-26 | 2024-05-02 | 富士通株式会社 | Work plan design program, work plan design method, and information processing device |
| CN117960635B (en) * | 2024-04-02 | 2024-05-28 | 贝榕物联(常州)有限公司 | Sorting data transmission method and system based on photoelectric fusion tag |
Family Cites Families (29)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US4936738A (en) * | 1988-04-26 | 1990-06-26 | Food Plant Engineering, Inc. | Alternating push back selective rack storage system |
| US5812986A (en) | 1996-02-23 | 1998-09-22 | Danelski; Darin L. | RF light directed inventory system |
| IL118686A0 (en) * | 1996-06-19 | 1996-10-16 | Eldat Communication Ltd | Navigation system using changeable signs |
| US6289260B1 (en) * | 1998-02-05 | 2001-09-11 | St. Onge Company | Automated order pick process |
| JP4056139B2 (en) * | 1998-07-17 | 2008-03-05 | 株式会社ソルベックス | Article management method, article management apparatus, and picking work apparatus in a picking work place |
| JP2001171841A (en) * | 1999-12-16 | 2001-06-26 | Murata Mach Ltd | Pickup device |
| JP2001225913A (en) * | 2000-02-15 | 2001-08-21 | Matsushita Electric Ind Co Ltd | Shipping control device for automated storage and retrieval warehouse |
| JP2002060023A (en) * | 2000-08-21 | 2002-02-26 | Toshiba Corp | Baggage receipt/delivery system and baggage receipt/ delivery method |
| JP2002284315A (en) * | 2001-03-27 | 2002-10-03 | Daifuku Co Ltd | Picking equipment |
| TW508516B (en) * | 2001-05-18 | 2002-11-01 | Mitac Int Corp | Warehousing system with optimum process management |
| CN1395199A (en) * | 2001-07-06 | 2003-02-05 | 英业达股份有限公司 | Computer automation management system for warehouse-in and warehouse-out and its method |
| CN1396543A (en) * | 2001-07-16 | 2003-02-12 | 英业达股份有限公司 | Method for simplifying goods choosing management |
| TW528973B (en) * | 2001-09-26 | 2003-04-21 | Ind Tech Res Inst | Distribution decision supporting system and device |
| US7991505B2 (en) * | 2003-08-29 | 2011-08-02 | Casepick Systems, Llc | Materials-handling system using autonomous transfer and transport vehicles |
| US7865398B2 (en) * | 2003-09-30 | 2011-01-04 | Microsoft Corporation | Radio frequency identification tag on picking container and display of picklist to order filler |
| KR20060020301A (en) * | 2004-08-31 | 2006-03-06 | 인천대학교 산학협력단 | Order picking method for warehouse |
| AT500727A3 (en) | 2004-09-14 | 2007-03-15 | Knapp Logistik Automation | picking |
| JP2006160388A (en) * | 2004-12-02 | 2006-06-22 | Murata Mach Ltd | Picking system |
| WO2006067829A1 (en) * | 2004-12-20 | 2006-06-29 | Hitachi, Ltd. | Work instruction device, work instruction method, and work instruction system |
| US8731708B2 (en) * | 2005-03-10 | 2014-05-20 | Amazon Technologies, Inc. | Method and apparatus for multi-destination item selection using motes |
| CN2915770Y (en) * | 2006-03-27 | 2007-06-27 | 中邮物流有限责任公司 | Goods-sorting checking logistic apparatus with voice |
| CN100537376C (en) * | 2006-03-27 | 2009-09-09 | 中邮物流有限责任公司 | Automatic goods-picking and checking system and method for commodities flow |
| US7877164B2 (en) * | 2007-02-16 | 2011-01-25 | Dematic Pty, Ltd. | Method and system for assembling pallets for stock orders |
| US8015079B2 (en) | 2008-01-07 | 2011-09-06 | Oracle International Corporation | Pick release performance using a multi-threaded architecture to distribute the workload across multiple processors |
| US20090199192A1 (en) * | 2008-02-05 | 2009-08-06 | Robert Laithwaite | Resource scheduling apparatus and method |
| JP2009263018A (en) * | 2008-04-22 | 2009-11-12 | Askul Corp | Picking system |
| JP5380913B2 (en) * | 2008-06-11 | 2014-01-08 | 株式会社寺岡精工 | Picking system, picking system management device |
| CN101968860A (en) * | 2010-10-09 | 2011-02-09 | 北京物资学院 | Order sorting method and system |
| CN104205135B (en) * | 2012-02-05 | 2018-06-19 | 麦修斯资源有限公司 | Order is persistently criticized to fulfil |
-
2013
- 2013-02-01 CN CN201380018017.3A patent/CN104205135B/en active Active
- 2013-02-01 JP JP2014555738A patent/JP6258870B2/en active Active
- 2013-02-01 CA CA2863811A patent/CA2863811C/en active Active
- 2013-02-01 WO PCT/US2013/024308 patent/WO2013116620A1/en active Application Filing
- 2013-02-01 EP EP13743539.2A patent/EP2810225A4/en not_active Withdrawn
- 2013-02-01 CN CN201810662617.8A patent/CN109064081B/en active Active
-
2015
- 2015-03-31 HK HK15103288.8A patent/HK1202957A1/en unknown
-
2017
- 2017-12-07 JP JP2017234738A patent/JP6615169B2/en active Active
-
2019
- 2019-11-05 JP JP2019200377A patent/JP6968136B2/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| JP6258870B2 (en) | 2018-01-10 |
| CN104205135A (en) | 2014-12-10 |
| CN104205135B (en) | 2018-06-19 |
| EP2810225A1 (en) | 2014-12-10 |
| WO2013116620A1 (en) | 2013-08-08 |
| CN109064081B (en) | 2021-12-10 |
| JP6968136B2 (en) | 2021-11-17 |
| JP2020040836A (en) | 2020-03-19 |
| EP2810225A4 (en) | 2015-09-09 |
| JP2015506324A (en) | 2015-03-02 |
| HK1202957A1 (en) | 2015-10-09 |
| JP6615169B2 (en) | 2019-12-04 |
| CA2863811A1 (en) | 2013-08-08 |
| JP2018076183A (en) | 2018-05-17 |
| CN109064081A (en) | 2018-12-21 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CA2863811C (en) | Perpetual batch order fulfillment | |
| US20210319391A1 (en) | Perpetual batch order fulfillment | |
| CN106311615B (en) | It is layered cargo picking method, system and computing device | |
| CN109835651B (en) | Goods sorting method, server and system | |
| US10572854B2 (en) | Order grouping in warehouse order fulfillment operations | |
| CN109118137B (en) | Order processing method, device, server and storage medium | |
| CN206622328U (en) | It is layered goods radio frequency | |
| JP6633815B2 (en) | Relay type article sorting system and sorting method | |
| AU2015287602B2 (en) | Picking station with automated warehouse | |
| CN107408285B (en) | Warehouse management system, warehouse, and warehouse management method | |
| US9580248B2 (en) | One-to many put sequence optimization | |
| JP7370747B2 (en) | Persistent batch order fulfillment | |
| JP7186160B2 (en) | Relay type article sorting system and sorting method | |
| CN106956883A (en) | Goods picking method, system, computing device and the storage medium of involving explosives money product | |
| JP7268172B2 (en) | Returnable Box Guidance in Warehouse Order Fulfillment Operations | |
| CN109544081B (en) | Logistics sorting mode matching method and system | |
| US7031801B1 (en) | Continuous item picking in a distribution center using coordinated item picking periods | |
| JP7268171B2 (en) | Optimized Tote Recommendation Process in Warehouse Order Fulfillment Behavior | |
| WO2024083030A1 (en) | Automatic combined order fulfillment method, warehouse management system, and warehouse exit order processing system | |
| US11479412B2 (en) | Order sortation systems | |
| CN107025533B (en) | Goods picking method, goods picking system, computing device and computer readable storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| EEER | Examination request |
Effective date: 20180124 |
|
| EEER | Examination request |
Effective date: 20180124 |