Automatic generation of load and route design

US2020242543A1 · US · A1

Patent metadata
FieldValue
Publication numberUS-2020242543-A1
Application numberUS-201916712783-A
CountryUS
Kind codeA1
Filing dateDec 12, 2019
Priority dateJan 30, 2019
Publication dateJul 30, 2020
Grant date

How to read this patent

A practical reading order for non-experts. Skip the full description unless you need deep technical detail.

  1. Title

    What the patent document calls the invention.

  2. Abstract

    A short plain-language summary of the technical disclosure.

  3. Assignees and inventors

    Who owns or filed the patent and who is credited as inventor.

  4. Key dates

    Filing, priority, publication, and grant dates set the timeline.

  5. First independent claim

    The legal scope of protection — read this for what is actually claimed.

  6. CPC / IPC classifications

    Technology tags used to group this patent with similar filings.

  7. Citations and related patents

    Prior art links and similar publications in this corpus.

Abstract

Official abstract text for this publication.

A system including one or more processors and one or more non-transitory computer-readable media storing computing instructions configured to run on the one or more processors and perform receiving orders from physical stores for fulfillment from a distribution center, each of the orders comprising a set of items and a requested delivery date; generating a stack building plan for each of the orders using simulated annealing; obtaining routes for delivering the orders in trailers from the distribution center to the physical stores based at least in part on the stack building plan; and generating a load design for each of the routes to deliver in a trailer of the trailers a load for one or more of the orders, such that floor spot assignments for stacks for each of the one or more of the orders in the load carried by the trailer satisfy sequence-of-delivery constraints and center-of-gravity constraints. Other embodiments are disclosed.

First claim

Opening claim text (preview).

What is claimed is: 1 . A system comprising: one or more processors; and one or more non-transitory computer-readable media storing computing instructions configured to run on the one or more processors and perform: receiving orders from physical stores for fulfillment from a distribution center, each of the orders comprising a set of items and a requested delivery date; generating a stack building plan for each of the orders using simulated annealing; obtaining routes for delivering the orders in trailers from the distribution center to the physical stores based at least in part on the stack building plan; and generating a load design for each of the routes to deliver in a trailer of the trailers a load for one or more of the orders, such that floor spot assignments for stacks for each of the one or more of the orders in the load carried by the trailer satisfy sequence-of-delivery constraints and center-of-gravity constraints. 2 . The system of claim 1 , wherein an order filling date is determined for each of the orders based at least in part on the requested delivery date of each respective one of the orders. 3 . The system of claim 1 , wherein generating the stack building plan for each of the orders using simulated annealing comprises, for each of the orders: determining the stack building plan for the order using simulated annealing to minimize a quantity of stacks to be built from pallets for the items in the order subject to a stack height limit, pallet stacking rules, and temperate range rules. 4 . The system of claim 1 , wherein the routes for the trailers are obtained using simulated annealing based at least in part on the stack building plan to determine routes that minimize distances subject to a weight constraint for each of the trailers and a floor spot capacity for each of the trailers. 5 . The system of claim 1 , wherein the routes split an order of the orders across two of the trailers when a quantity of stacks in the order exceeds a floor spot capacity for one of the trailers. 6 . The system of claim 1 , wherein the routes comprise the sequence-of-delivery constraints. 7 . The system of claim 1 , wherein the routes comprise a driving schedule generated subject to rest constraints. 8 . The system of claim 1 , wherein the center-of-gravity constraints the trailer are determined as a range of positions of the trailer based on a weight of the load carried by the trailer, positions of axles of the trailer; and weight limits for the axles of the trailer. 9 . The system of claim 1 , wherein, when the trailer is a dry trailer, the floor spot assignments for the stacks are assigned based at least in part on a quantity of the one or more of the orders in the load, such that: when the quantity of the one or more of the orders in the load is equal to one, the floor spot assignments place the stacks that are heaviest in a middle of the trailer; when the quantity of the one or more of the orders in the load is equal to two, the floor spot assignments place the stacks associated with a first stop in descending weight order and place the stacks associated with a last stop in ascending weight order; and when the quantity of the one or more of the orders in the load is equal to three, the floor spot assignments place the stacks associated with a first stop in descending weight order, place the stacks associated with a second stop that are heaviest in a middle of the trailer, and place the stacks associated with a last stop in ascending weight order. 10 . The system of claim 1 , wherein, when the trailer is a tri-temp trailer, the floor spot assignments for the stacks are determined based at least in part on a quantity of different temperature ranges associated with the one or more of the orders in the load. 11 . A method being implemented via execution of computing instructions configured to run at one or more processors and stored at one or more non-transitory computer-readable media, the method comprising: receiving orders from physical stores for fulfillment from a distribution center, each of the orders comprising a set of items and a requested delivery date; generating a stack building plan for each of the orders using simulated annealing; obtaining routes for delivering the orders in trailers from the distribution center to the physical stores based at least in part on the stack building plan; and generating a load design for each of the routes to deliver in a trailer of the trailers a load for one or more of the orders, such that floor spot assignments for stacks for each of the one or more of the orders in the load carried by trailer satisfy sequence-of-delivery constraints and center-of-gravity constraints. 12 . The method of claim 11 , wherein an order filling date is determined for each of the orders based at least in part on the requested delivery date of each respective one of the orders. 13 . The method of claim 11 , wherein generating the stack building plan for each of the orders using simulated annealing comprises, for each of the orders: determining the stack building plan for the order using simulated annealing to minimize a quantity of stacks to be built from pallets for the items in the order subject to a stack height limit, pallet stacking rules, and temperate range rules. 14 . The method of claim 11 , wherein the routes for the trailers are obtained using simulated annealing based at least in part on the stack building plan to determine routes that minimize distances subject to a weight constraint for each of the trailers and a floor spot capacity for each of the trailers. 15 . The method of claim 11 , wherein the routes split an order of the orders across two of the trailers when a quantity of stacks in the order exceeds a floor spot capacity for one of the trailers. 16 . The method of claim 11 , wherein the routes comprise the sequence-of-delivery constraints. 17 . The method of claim 11 , wherein the routes comprise a driving schedule generated subject to rest constraints. 18 . The method of claim 11 , wherein the center-of-gravity constraints the trailer are determined as a range of positions of the trailer based on a weight of the load carried by the trailer, positions of axles of the trailer; and weight limits for the axles of the trailer. 19 . The method of claim 11 , wherein, when the trailer is a dry trailer, the floor spot assignments for the stacks are assigned based at least in part on a quantity of the one or more of the orders in the load, such that: when the quantity of the one or more of the orders in the load is equal to one, the floor spot assignments place the stacks that are heaviest in a middle of the trailer; when the quantity of the one or more of the orders in the load is equal to two, the floor spot assignments place the stacks associated with a first stop in descending weight order and place the stacks associated with a last stop in ascending weight order; and when the quantity of the one or more of the orders in the load is equal to three, the floor spot assignments place the stacks associated with a first stop in descending weight order, place the stacks associated with a second stop that are heaviest in a middle of the trailer, and place the stacks associated with a last stop in ascending weight order. 20 . The method of claim 11 , wherein, when the trailer is a tri-temp trailer, the floor spot assignments for the stacks are determined based at least in part on a quantity of different temperature ranges associat

Assignees

Inventors

Classifications

  • using optimisation of routes · CPC title

  • Optimisation of two dimensional placement, e.g. cutting of clothes or wood · CPC title

  • Routing methods · CPC title

  • G06Q10/087Primary

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

  • Physics · mapped topic

Patent family

Related publications grouped by family.

External sources

Frequently asked questions

Answers are generated from the same data shown on this page.

What does patent US2020242543A1 cover?
A system including one or more processors and one or more non-transitory computer-readable media storing computing instructions configured to run on the one or more processors and perform receiving orders from physical stores for fulfillment from a distribution center, each of the orders comprising a set of items and a requested delivery date; generating a stack building plan for each of the or…
Who is the assignee on this patent?
Walmart Apollo Llc
What technology area does this patent fall under?
Primary CPC classification G06Q10/08355. Mapped technology areas include Physics.
When was this patent published?
Publication date Thu Jul 30 2020 00:00:00 GMT+0000 (Coordinated Universal Time) (A1). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 8 related publications on this page (citations in our corpus or others sharing the same primary CPC).