# US 2024/0257044 A1 · Unstacking optimization

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2024/0257044 A1
- Document ID: US20240257044A1
- Status: Published application
- Kind: A1
- Application number: 18/103,077
- Filed: 2023-01-30
- Published: 2024-08-01
- Earliest claimed: 2023-01-30
- Assignees: Walmart Apollo, LLC
- Applicants: Walmart Apollo, LLC
- Inventors: Tiantian Nie; Xiaojie Wang; Ti Zhang; Jing Huang; Mingang Fu
- Web page: https://patentgrep.com/patent/US20240257044A1

## CPC

- G06Q 10/083: Shipping
- G06Q 10/087: Inventory or stock management, e.g. order filling, procurement or balancing against orders
- 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

## Abstract

A system including one or more processors and one or more non-transitory computer-readable media storing computing instructions, that when executed on the one or more processors, cause the one or more processors, to perform: obtaining a first load plan, wherein the first load plan comprises a set of stacks assigned to floor spots of a trailer; determining that at least one of (a) there is an empty floor spot in the first load plan for the trailer or (b) the first load plan is infeasible; determining a target number of stacks for an updated load plan; iterating, via simulated annealing, through modifications to the updated load plan; terminating the iterating when a predetermined termination criteria is satisfied; and outputting the updated load plan. Other embodiments are disclosed.

## Claims

### Claim 1

A system comprising:
one or more processors; and
one or more non-transitory computer-readable media storing computing instructions, that when executed on the one or more processors, cause the one or more processors, to perform:
obtaining a first load plan, wherein the first load plan comprises a set of stacks assigned to floor spots of a trailer;
determining that at least one of (a) there is an empty floor spot in the first load plan for the trailer or (b) the first load plan is infeasible;
determining a target number of stacks for an updated load plan;
iterating, via simulated annealing, through modifications to the updated load plan;
terminating the iterating when a predetermined termination criteria is satisfied; and
outputting the updated load plan.

### Claim 2 (depends on 1)

The system of claim 1, wherein determining the target number of stacks comprises:
determining whether a quantity of pallets in the set of stacks is greater than or equal to a maximum number of floor spots of the trailer;
when the quantity of pallets is less than the maximum number of floor spots of the trailer, determining whether the first load plan is feasible; and
when the first load plan is feasible, setting the target number of stacks equal to the quantity of pallets.

### Claim 3 (depends on 2)

The system of claim 2, wherein determining the target number of stacks further comprises:
when the first load plan is not feasible:
setting the target number of stacks equal to one fewer than the quantity of pallets; and
when the set of stacks comprises dry pallets, the target number of stacks is an odd number and adding an empty pallet will exceed a weight limit of the trailer, reducing the target number of stacks by one.

### Claim 4 (depends on 2)

The system of claim 2, wherein determining the target number of stacks further comprises:
when the quantity of pallets is greater than or equal to the maximum number of floor spots of the trailer and the set of stacks comprises temperature-controlled pallets with perishable goods:
for each respective temperature compartment of the trailer:
reducing a respective quantity of a respective subset of the set of stacks by one when a respective subset of the set of stacks for each respective temperature compartment are not combinable and are an odd number; and
setting the target number of stacks equal to a sum of the respective quantities of the respective subsets of the set of stacks.

### Claim 5 (depends on 2)

The system of claim 2, wherein determining the target number of stacks further comprises:
when the quantity of pallets is greater or equal to the maximum number of floor spots of the trailer and the set of stacks do not comprise temperature-controlled pallets with perishable goods, setting the target number of stacks equal to the maximum number of floor spots.

### Claim 6 (depends on 1)

The system of claim 1, wherein iterating, via simulated annealing, through the modifications to the updated load plan comprises:
receiving, as input, the target number of stacks for the first load plan;
initializing a solution for the updated load plan based on the first load plan;
until one or more predetermined termination criteria are satisfied, iteratively performing:
performing a local search to determine a potential new solution to the updated load plan; and
when the potential new solution satisfies one or more predetermined improved-solution criteria, updating the solution to be the potential new solution; and
outputting the solution as the updated load plan.

### Claim 7 (depends on 6)

The system of claim 6, wherein the one or more predetermined improved-solution criteria comprise:
the solution is not feasible, and the potential new solution is feasible; or
the solution is feasible, and a number of stacks in the potential new solution is more than a number of stacks in the solution.

### Claim 8 (depends on 6)

The system of claim 6, wherein the one or more predetermined termination criteria comprise:
a quantity of stacks in the solution is equal to the target number of stacks; and
the solution is feasible.

### Claim 9 (depends on 6)

The system of claim 6, wherein the one or more predetermined termination criteria comprises:
exceeding a predetermined time limit.

### Claim 10 (depends on 6)

The system of claim 6, wherein the one or more predetermined termination criteria comprises:
exceeding a predetermined iteration limit.

### Claim 11

A method being implemented via execution of computing instruction configured to run on one or more processors and stored at one or more non-transitory computer-readable media, the method comprising:
obtaining a first load plan, wherein the first load plan comprises a set of stacks assigned to floor spots of a trailer;
determining that at least one of (a) there is an empty floor spot in the first load plan for the trailer or (b) the first load plan is infeasible;
determining a target number of stacks for an updated load plan;
iterating, via simulated annealing, through modifications to the updated load plan;
terminating the iterating when a predetermined termination criteria is satisfied; and
outputting the updated load plan.

### Claim 12 (depends on 11)

The method of claim 11, wherein determining the target number of stacks comprises:
determining whether a quantity of pallets in the set of stacks is greater than or equal to a maximum number of floor spots of the trailer;
when the quantity of pallets is less than the maximum number of floor spots of the trailer, determining whether the first load plan is feasible; and
when the first load plan is feasible, setting the target number of stacks equal to the quantity of pallets.

### Claim 13 (depends on 12)

The method of claim 12, wherein determining the target number of stacks further comprises:
when the first load plan is not feasible:
setting the target number of stacks equal to one fewer than the quantity of pallets; and
when the set of stacks comprises dry pallets, the target number of stacks is an odd number and adding an empty pallet will exceed a weight limit of the trailer, reducing the target number of stacks by one.

### Claim 14 (depends on 12)

The method of claim 12, wherein determining the target number of stacks further comprises:
when the quantity of pallets is greater than or equal to the maximum number of floor spots of the trailer and the set of stacks comprises temperature-controlled pallets with perishable goods:
for each respective temperature compartment of the trailer:
reducing a respective quantity of a respective subset of the set of stacks by one when a respective subset of the set of stacks for each respective temperature compartment are not combinable and are an odd number; and
setting the target number of stacks equal to a sum of the respective quantities of the respective subsets of the set of stacks.

### Claim 15 (depends on 12)

The method of claim 12, wherein determining the target number of stacks further comprises:
when the quantity of pallets is greater or equal to the maximum number of floor spots of the trailer and the set of stacks do not comprise temperature-controlled pallets with perishable goods, setting the target number of stacks equal to the maximum number of floor spots.

### Claim 16 (depends on 11)

The method of claim 11, wherein iterating, via simulated annealing, through the modifications to the updated load plan comprises:
receiving, as input, the target number of stacks for the first load plan;
initializing a solution for the updated load plan based on the first load plan;
until one or more predetermined termination criteria are satisfied, iteratively performing:
performing a local search to determine a potential new solution to the updated load plan; and
when the potential new solution satisfies one or more predetermined improved-solution criteria, updating the solution to be the potential new solution; and
outputting the solution as the updated load plan.

### Claim 17 (depends on 16)

The method of claim 16, wherein the one or more predetermined improved-solution criteria comprise:
the solution is not feasible, and the potential new solution is feasible; or
the solution is feasible, and a number of stacks in the potential new solution is more than a number of stacks in the solution.

### Claim 18 (depends on 16)

The method of claim 16, wherein the one or more predetermined termination criteria comprise:
a quantity of stacks in the solution is equal to the target number of stacks; and
the solution is feasible.

### Claim 19 (depends on 16)

The method of claim 16, wherein the one or more predetermined termination criteria comprises:
exceeding a predetermined time limit.

### Claim 20 (depends on 16)

The method of claim 16, wherein the one or more predetermined termination criteria comprises:
exceeding a predetermined iteration limit.
