# US 2024/0005237 A1 · System and Method of Reinforced Machine-Learning Retail Allocation

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

- Number: US 2024/0005237 A1
- Document ID: US20240005237A1
- Status: Published application
- Kind: A1
- Application number: 18/368,916
- Filed: 2023-09-15
- Published: 2024-01-04
- Earliest claimed: 2019-12-13
- Assignees: Blue Yonder Group, Inc.
- Applicants: Blue Yonder Group, Inc.
- Inventors: Ganesh Muthusamy; Sudhakar Jayapal; Karthik Kondapaneni; Rajneesh Kumar Agrawal
- Web page: https://patentgrep.com/patent/US20240005237A1

## CPC

- G06Q 10/087: Inventory or stock management, e.g. order filling, procurement or balancing against orders
- G06N 3/006: based on simulated virtual individual or collective life forms, e.g. social simulations or particle swarm optimisation [PSO]
- G06N 5/04: Inference or reasoning models
- G06N 20/00: Machine learning
- G06Q 10/06313: {Resource planning in a project environment}
- G06Q 10/067: Enterprise or organisation modelling
- G06Q 10/08: Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- G06Q 10/0872: {using inventory planning}
- G06Q 30/0202: Market predictions or forecasting for commercial activities
- G06Q 10/08726: {for replenishment processing, procedures, or recommendations using forecasting or optimisation}
- 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
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS

## Abstract

A system and method for allocation planning comprise a server comprising a processor and memory and configured to calculate a reward for a historical allocation of a product to one or more stores associated with a retailer. Embodiments include simulating what-if scenarios for the historical allocation to identify an allocation having a greater reward than the historical allocation and allocating a quantity of a product for a current allocation to the one or more stores based, at least in part, on a distance calculation of one or more independent variables for the historical allocation and the current allocation and the identified allocation having the greater reward then the historical allocation.

## Claims

### Claim 1

A system of allocation planning, comprising:
a network, automated warehousing equipment and a server, comprising a processor and memory, the server operably connected over the network to the automated warehousing equipment, the server further configured to:
calculate, using a reward-penalty function as part of a reinforcement learning process, a reward for a historical allocation of a product to one or more stores associated with a retailer, wherein the reward-penalty function comprises product margin, inventory carrying cost and opportunity cost represented by Bellman's equation;
calculate a constrained allocation quantity;
allocate a quantity of a product for a current allocation to the one or more stores based, at least in part, on the constrained allocation quantity; and
responsive to a difference between a current inventory level and the constrained allocation quantity, retrieve a quantity of the product equal to the difference between the current inventory level and the constrained allocation quantity for transportation to stores by sending instructions over the network to the automated warehousing equipment of one or more distribution centers to automatically retrieve the quantity of the product.

### Claim 2 (depends on 1)

The system of claim 1, wherein the server is further configured to:
calculate a pre-season buy based at least in part on the constrained allocation quantity.

### Claim 3 (depends on 1)

The system of claim 1, wherein the server is further configured to:
calculate the constrained allocation quantity for the one or more stores based, at least in part, on an overall profit across all stores of the retailer to reduce mark down impact and to reduce stock-outs.

### Claim 4 (depends on 1)

The system of claim 1, wherein the server is further configured to:
retrieve the quantity of the product according to one or more of:
a minimum order quantity, a maximum order quantity, a discount, a step-size order quantity and one or more batch quantity rules.

### Claim 5 (depends on 1)

The system of claim 1, wherein the one or more stores comprise one or more nodes of a multi-echelon supply chain.

### Claim 6 (depends on 1)

The system of claim 1, wherein the reinforcement learning process further comprises a finite set of states, each state of the finite set of states comprising an amount of stock of the product at a particular time for one or more inventory locations.

### Claim 7 (depends on 6)

The system of claim 6, wherein transitions between states occur when a demand leads to a sale and inventory increases by receipt of allocated products.

### Claim 8

A computer-implemented method of allocation planning, comprising:
networking a computer with automated warehousing equipment;
calculating, by the computer comprising a processor and memory, using a reward-penalty function as part of a reinforcement learning process, a reward for a historical allocation of a product to one or more stores associated with a retailer, wherein the reward-penalty function comprises product margin, inventory carrying cost and opportunity cost represented by Bellman's equation;
calculating, by the computer, a constrained allocation quantity;
allocating, by the computer, a quantity of a product for a current allocation to the one or more stores based, at least in part, on the constrained allocation quantity; and
responsive to a difference between a current inventory level and the constrained allocation quantity, retrieve a quantity of the product equal to the difference between the current inventory level and the constrained allocation quantity for transportation to stores by sending instructions over the network to the automated warehousing equipment of one or more distribution centers to automatically retrieve the quantity of the product.

### Claim 9 (depends on 8)

The computer-implemented method of claim 8, further comprising:
calculating, by the computer a pre-season buy based at least in part on the constrained allocation quantity.

### Claim 10 (depends on 8)

The computer-implemented method of claim 8, further comprising:
calculating, by the computer, the constrained allocation quantity for the one or more stores based, at least in part, on an overall profit across all stores of the retailer to reduce mark down impact and to reduce stock-outs.

### Claim 11 (depends on 8)

The computer-implemented method of claim 8, further comprising:
retrieving, by the computer, the quantity of the product according to one or more of:
a minimum order quantity, a maximum order quantity, a discount, a step-size order quantity and one or more batch quantity rules.

### Claim 12 (depends on 8)

The computer-implemented method of claim 8, wherein the one or more stores comprise one or more nodes of a multi-echelon supply chain.

### Claim 13 (depends on 8)

The computer-implemented method of claim 8, wherein the reinforcement learning process further comprises a finite set of states, each state of the finite set of states comprising an amount of stock of the product at a particular time for one or more inventory locations.

### Claim 14 (depends on 13)

The computer-implemented method of claim 13, wherein transitions between states occur when a demand leads to a sale and inventory increases by receipt of allocated products.

### Claim 15

A non-transitory computer-readable medium embodied with software, the software when executed:
networks a computer with automated warehousing equipment;
calculates, using a reward-penalty function as part of a reinforcement learning process, a reward for a historical allocation of a product to one or more stores associated with a retailer, wherein the reward-penalty function comprises product margin, inventory carrying cost and opportunity cost represented by Bellman's equation;
calculates a constrained allocation quantity;
allocates a quantity of a product for a current allocation to the one or more stores based, at least in part, on the constrained allocation quantity; and
responsive to a difference between a current inventory level and the constrained allocation quantity, retrieves a quantity of the product equal to the difference between the current inventory level and the constrained allocation quantity for transportation to stores by sending instructions over the network to the automated warehousing equipment of one or more distribution centers to automatically retrieve the quantity of the product.

### Claim 16 (depends on 15)

The non-transitory computer-readable medium of claim 15, the software when executed further:
calculates a pre-season buy based at least in part on the constrained allocation quantity.

### Claim 17 (depends on 15)

The non-transitory computer-readable medium of claim 15, the software when executed further:
calculates the constrained allocation quantity for the one or more stores based, at least in part, on an overall profit across all stores of the retailer to reduce mark down impact and to reduce stock-outs.

### Claim 18 (depends on 15)

The non-transitory computer-readable medium of claim 15, the software when executed further:
retrieves the quantity of the product according to one or more of:
a minimum order quantity, a maximum order quantity, a discount, a step-size order quantity and one or more batch quantity rules.

### Claim 19 (depends on 15)

The non-transitory computer-readable medium of claim 15, wherein the one or more stores comprise one or more nodes of a multi-echelon supply chain.

### Claim 20 (depends on 15)

The non-transitory computer-readable medium of claim 15, wherein the reinforcement learning process further comprises a finite set of states, each state of the finite set of states comprising an amount of stock of the product at a particular time for one or more inventory locations.
