# US 2016/0260109 A1 · System and method for forecasting using monte carlo methods

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

- Number: US 2016/0260109 A1
- Document ID: US20160260109A1
- Status: Published application
- Kind: A1
- Application number: 14/638,155
- Filed: 2015-03-04
- Published: 2016-09-08
- Earliest claimed: 2015-03-04
- Assignees: Wal-Mart Stores, Inc.
- Applicants: Wal-Mart Stores, Inc.
- Inventors: Huijun Feng; Shubhankar Ray
- Web page: https://patentgrep.com/patent/US20160260109A1

## CPC

- G06Q 10/087: Inventory or stock management, e.g. order filling, procurement or balancing against orders
- G06Q 10/06315: {Needs-based resource requirements planning or analysis}
- G06Q 10/08726: {for replenishment processing, procedures, or recommendations using forecasting or optimisation}
- G06Q 30/0201: Market modelling; Market analysis; Collecting market data
- G06Q 30/0202: Market predictions or forecasting for commercial activities
- Y04S 10/50: Systems or methods supporting the power network operation or management, involving a certain degree of interaction with the load-side end user applications
- 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
- Y04S: SYSTEMS INTEGRATING TECHNOLOGIES RELATED TO POWER NETWORK OPERATION, COMMUNICATION OR INFORMATION TECHNOLOGIES FOR IMPROVING THE ELECTRICAL POWER GENERATION, TRANSMISSION, DISTRIBUTION, MANAGEMENT OR USAGE, i.e. SMART GRIDS

## Abstract

A system and method for calculating demand forecasts is presented. Sales data for a set of SKUs is received. The sales data is filtered to contain only data for low-selling SKUs. A set of clusters of SKUs is created. A generalized dynamic linear model for use with each cluster in the set of clusters is generated. A set of random data points is generated. The dynamic linear model is fitted at each data point in the set of random data points using a Monte Carlo method. This fitting can be performed using an unscented Kalman filter method. Calculating a forecast for sales based on the fitting at each data point. Using the forecast for sales, inventory is ordered. Other embodiments are also disclosed herein.

## Claims

### Claim 1

A method comprising:
receiving sales data for a set of stock keeping units (SKUs);
filtering the sales data to contain only data for low-selling SKUs, within the set of SKUs that have sales within a bottom twenty percent of the set of SKUs;
creating a set of clusters of SKUs from the set of SKUs;
generating a dynamic linear model for use with each cluster in the set of clusters;
generating a set of random data points;
fitting the dynamic linear model at each data point in the set of random data points using a Monte Carlo method;
calculating a forecast for sales of the low-selling SKUs based on the fitting at each data point in the set of random data points; and
ordering inventory based on the forecast for sales of the low-selling SKUs.

### Claim 2 (depends on 1)

The method of claim 1 wherein:
the set of random data points are chosen based on an expected value and covariance of the dynamic linear model.

### Claim 3 (depends on 2)

The method of claim 2 wherein:
the set of random data points comprises approximately 1,000 data points.

### Claim 4 (depends on 1)

The method of claim 1 wherein:
fitting the dynamic linear model at each data point in the set of random data points using the Monte Carlo method comprises using a Cholesky decomposition of an expected value matrix based on the dynamic linear model.

### Claim 5 (depends on 1)

The method of claim 1 further comprising:
repeating calculating the forecast for a plurality of data points.

### Claim 6 (depends on 1)

The method of claim 1 wherein:
fitting the dynamic linear model at each point in the set of random data points comprises using a Kalman filter to fit the dynamic linear model by calculating a value of an integral at each data point in the set of random data points.

### Claim 7 (depends on 1)

The method of claim 1 wherein:
fitting the dynamic linear model at each data point in the set of random data points comprises using an unscented Kalman filter using the set of random data points in place of a set of sigma points.

### Claim 8

A system comprising:
a user input device;
a display device;
one or more processing modules; and
one or more non-transitory storage modules storing computing instructions configured to run on the one or more processing modules and perform the acts of:
receiving sales data for a set of stock keeping units (SKUs);
filtering the sales data to contain only data for low-selling SKUs, within the set of SKUs that have sales within a bottom twenty percent of the set of SKUs;
creating a set of clusters of SKUs from the set of SKUs;
generating a dynamic linear model for use with each cluster in the set of clusters;
generating a set of random data points;
fitting the dynamic linear model at each data point in the set of random data points using a Monte Carlo method;
calculating a forecast for sales of the low-selling SKUs based on the fitting at each data point in the set of random data points; and
ordering inventory based on the forecast for sales of the low-selling SKUs.

### Claim 9 (depends on 8)

The system of claim 8 wherein:
the set of random data points are chosen based on an expected value and covariance of the dynamic linear model.

### Claim 10 (depends on 9)

The system of claim 9 wherein:
the set of random data points comprises approximately 1,000 data points.

### Claim 11 (depends on 8)

The system of claim 8 wherein:
fitting the dynamic linear model at each data point in the set of random data points using the Monte Carlo method comprises using a Cholesky decomposition of an expected value matrix based on the dynamic linear model.

### Claim 12 (depends on 8)

The system of claim 8 wherein the computing instructions further comprise:
repeating calculating the forecast for a plurality of data points.

### Claim 13 (depends on 8)

The system of claim 8 wherein:
fitting the dynamic linear model at each point in the set of random data points comprises using a Kalman filter to fit the dynamic linear model by calculating a value of an integral at each data point in the set of random data points.

### Claim 14 (depends on 8)

The system of claim 8 wherein:
fitting the dynamic linear model at each data point in the set of random data points comprises using an unscented Kalman filter using the set of random data points in place of a set of sigma points.

### Claim 15

At least one non-transitory storage module having computing instructions stored thereon executable to perform the acts of:
receiving sales data for a set of stock keeping units (SKUs);
filtering the sales data to contain only data for low-selling SKUs, within the set of SKUs that have sales within a bottom twenty percent of the set of SKUs;
creating a set of clusters of SKUs from the set of SKUs;
generating a dynamic linear model for use with each cluster in the set of clusters;
generating a set of random data points;
fitting the dynamic linear model at each data point in the set of random data points using a Monte Carlo method;
calculating a forecast for sales of the low-selling SKUs based on the fitting at each data point in the set of random data points; and
ordering inventory based on the forecast for sales of the low-selling SKUs.

### Claim 16 (depends on 15)

The at least one non-transitory storage module system of claim 15 wherein:
the set of random data points are chosen based on an expected value and covariance of the dynamic linear model.

### Claim 17 (depends on 16)

The at least one non-transitory storage module system of claim 16 wherein:
the set of random data points comprises approximately 1,000 data points.

### Claim 18 (depends on 15)

The at least one non-transitory storage module system of claim 15 wherein:
fitting the dynamic linear model at each data point in the set of random data points using the Monte Carlo method comprises using a Cholesky decomposition of an expected value matrix based on the dynamic linear model.

### Claim 19 (depends on 15)

The at least one non-transitory storage module system of claim 15 wherein:
fitting the dynamic linear model at each point in the set of random data points comprises using a Kalman filter to fit the dynamic linear model by calculating a value of an integral at each data point in the set of random data points.

### Claim 20 (depends on 15)

The at least one non-transitory storage module system of claim 15 wherein:
fitting the dynamic linear model at each data point in the set of random data points comprises using an unscented Kalman filter using the set of random data points in place of a set of sigma points.
