Multi-threading and perishable splitting techniques in load and route planning
US-2024257039-A1 · Aug 1, 2024 · US
US2020242543A1 · US · A1
| Field | Value |
|---|---|
| Publication number | US-2020242543-A1 |
| Application number | US-201916712783-A |
| Country | US |
| Kind code | A1 |
| Filing date | Dec 12, 2019 |
| Priority date | Jan 30, 2019 |
| Publication date | Jul 30, 2020 |
| Grant date | — |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
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.
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
using optimisation of routes · CPC title
Optimisation of two dimensional placement, e.g. cutting of clothes or wood · CPC title
Routing methods · CPC title
Inventory or stock management, e.g. order filling, procurement or balancing against orders · CPC title
Physics · mapped topic
Related publications grouped by family.
Answers are generated from the same data shown on this page.