# US 2017/0286899 A1 · Inter-store inventory transfer

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

- Number: US 2017/0286899 A1
- Document ID: US20170286899A1
- Status: Published application
- Kind: A1
- Application number: 15/090,921
- Filed: 2016-04-05
- Published: 2017-10-05
- Earliest claimed: 2016-04-05
- Assignees: International Business Machines Corporation
- Applicants: International Business Machines Corporation
- Inventors: Ajay A. Deshpande; Arun Hampapur; Yingjie Li; Ding Ding Lin; Xuan Liu; Dahai Xing; Xiao Bo Zheng
- Web page: https://patentgrep.com/patent/US20170286899A1

## CPC

- G06Q 10/087: Inventory or stock management, e.g. order filling, procurement or balancing against orders
- G06Q 10/08744: {by distributed inventory management}
- 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

## Abstract

Examples of techniques for generating an inter-store inventory transfer are disclosed. In one example implementation according to aspects of the present disclosure, a computer-implemented method may include defining a subset of stores of a plurality of stores to fulfill inter-store inventory transfer request for a product category of a plurality of product categories. The method may further include, responsive to determining that an order for a product of the product category cannot be fulfilled by one of the stores of the subset of stores of the plurality of stores, determining, by a processing device, an alternate store of the subset of stores to fulfill the order.

## Claims

### Claim 1

A computer-implemented method for generating an inter-store inventory transfer, the method comprising:
defining a subset of stores of a plurality of stores to fulfill inter-store inventory transfer request for a product category of a plurality of product categories; and
responsive to determining that an order for a product of the product category cannot be fulfilled by one of the stores of the subset of stores of the plurality of stores, determining, by a processing device, an alternate store of the subset of stores to fulfill the order.

### Claim 2 (depends on 1)

The computer-implemented method of claim 1, wherein a customer is located at the one of the stores of the subset of stores of the plurality of stores that cannot fulfill the order.

### Claim 3 (depends on 1)

The computer-implemented method of claim 1, wherein defining a subset of stores of a plurality of stores to fulfill inter-store inventory transfer requests for a product category further comprises:
receiving aggregated in-store demand data for each of the plurality of stores.

### Claim 4 (depends on 3)

The computer-implemented method of claim 3, wherein defining a subset of stores of a plurality of stores to fulfill inter-store inventory transfer requests for a product category further comprises:
receiving control parameters.

### Claim 5 (depends on 4)

The computer-implemented method of claim 4, wherein the control parameters comprise at least one of a product shipping cost, a product handling cost, a service level penalty cost, and an inventory capacity of each product of the product category at each of the subset of the plurality of stores.

### Claim 6 (depends on 4)

The computer-implemented method of claim 4, wherein defining a subset of stores of a plurality of stores to fulfill inter-store inventory transfer requests for a product category further comprises:
formulating, by the processing device, a mixed integer programming model to calculate, based on the demand data and the control parameters, a minimized total cost-to-serve to fulfill a demand of a product for each of the plurality of product categories, each of a plurality of demand zones, and the subset of stores; and
storing the minimized total cost-to serve in an inventory pool data repository.

### Claim 7 (depends on 1)

The computer-implemented method of claim 1, wherein determining the alternate store of the subset of stores to fulfill the order further comprises:
querying an inventory pool data repository storing a calculated minimized total cost-to-serve and the subset of stores.

### Claim 8 (depends on 7)

The computer-implemented method of claim 7, wherein determining the alternate store of the subset of stores to fulfill the order further comprises:
querying an inventory status of each store of the subset of stores.

### Claim 9 (depends on 8)

The computer-implemented method of claim 8, wherein determining the alternate store of the subset of stores to fulfill the order further comprises:
determining, by the processing device, the alternate store of the subset of stores to fulfill the order with an objective of minimizing at least one of a shipping cost, an inventory balancing cost, and a markdown cost.

### Claim 10 (depends on 9)

The computer-implemented method of claim 9, wherein determining the alternate store of the subset of stores to fulfill the order further comprises:
responsive to determining the alternate store of the subset of stores to fulfill the order, generating an inter-store transfer order to the alternate store to fulfill the order.

### Claim 11 (depends on 1)

The computer-implemented method of claim 1, wherein determining the alternate store of the subset of stores to fulfill the order further comprises:
responsive to determining that no alternate store of the subset of stores can fulfill the order, passing the order to an e-commerce system to fulfill the order.

### Claim 12

A system for generating an inter-store inventory transfer, the system comprising:
a processor in communication with one or more types of memory, the processor configured to:
define a subset of stores of a plurality of stores to fulfill inter-store inventory transfer request for a product category of a plurality of product categories; and
responsive to determining that an order for a product of the product category cannot be fulfilled by one of the stores of the subset of stores of the plurality of stores, determine an alternate store of the subset of stores to fulfill the order.

### Claim 13 (depends on 12)

The system of claim 12, wherein a customer is located at the one of the stores of the subset of stores of the plurality of stores that cannot fulfill the order.

### Claim 14 (depends on 12)

The system of claim 12, wherein defining a subset of stores of a plurality of stores to fulfill inter-store inventory transfer requests for a product category further comprises:
receiving aggregated in-store demand data for each of the plurality of stores;
receiving control parameters;
formulating, by the processing device, a mixed integer programming model to calculate, based on the demand data and the control parameters, a minimized total cost-to-serve to fulfill a demand of a product for each of the plurality of product categories, each of a plurality of demand zones, and the subset of stores; and
storing the minimized total cost-to serve in an inventory pool data repository.

### Claim 15 (depends on 14)

The system of claim 14, wherein the control parameters comprise at least one of a product shipping cost, a product handling cost, a service level penalty cost, and an inventory capacity of each product of the product category at each of the subset of the plurality of stores.

### Claim 16 (depends on 12)

The system of claim 12, wherein determining the alternate store of the subset of stores to fulfill the order further comprises:
querying an inventory pool data repository storing a calculated minimized total cost-to-serve and the subset of stores;
querying an inventory status of each store of the subset of stores;
determining, by the processing device, the alternate store of the subset of stores to fulfill the order with an objective of minimizing at least one of a shipping cost, an inventory balancing cost, and a markdown cost; and
responsive to determining the alternate store of the subset of stores to fulfill the order, generating an inter-store transfer order to the alternate store to fulfill the order.

### Claim 17

A computer program product for generating an inter-store inventory transfer, the computer program product comprising:
a non-transitory storage medium readable by a processing circuit and storing instructions for execution by the processing circuit for performing a method comprising:
defining a subset of stores of a plurality of stores to fulfill inter-store inventory transfer request for a product category of a plurality of product categories; and
responsive to determining that an order for a product of the product category cannot be fulfilled by one of the stores of the subset of stores of the plurality of stores, determining an alternate store of the subset of stores to fulfill the order.

### Claim 18 (depends on 17)

The computer program product of claim 17, wherein a customer is located at the one of the stores of the subset of stores of the plurality of stores that cannot fulfill the order.

### Claim 19 (depends on 17)

The computer program product of claim 17, wherein defining a subset of stores of a plurality of stores to fulfill inter-store inventory transfer requests for a product category further comprises:
receiving aggregated in-store demand data for each of the plurality of stores;
receiving control parameters;
formulating, by the processing device, a mixed integer programming model to calculate, based on the demand data and the control parameters, a minimized total cost-to-serve to fulfill a demand of a product for each of the plurality of product categories, each of a plurality of demand zones, and the subset of stores; and
storing the minimized total cost-to serve in an inventory pool data repository.

### Claim 20 (depends on 17)

The computer program product of claim 17, wherein determining the alternate store of the subset of stores to fulfill the order further comprises:
querying an inventory pool data repository storing a calculated minimized total cost-to-serve and the subset of stores;
querying an inventory status of each store of the subset of stores;
determining, by the processing device, the alternate store of the subset of stores to fulfill the order with an objective of minimizing at least one of a shipping cost, an inventory balancing cost, and a markdown cost; and
responsive to determining the alternate store of the subset of stores to fulfill the order, generating an inter-store transfer order to the alternate store to fulfill the order.
