IP Library Granted Patent US 12,468,992
Granted Patent B2
US 12,468,992 · App. 17/174,667 · Granted Nov 11, 2025

Item substitution techniques for assortment optimization and product fulfillment

Inventors: Amit Pande (Ames, IA); Aparupa Das Gupta (Minneapolis, MN); Kai Ni (Chanhassen, MN); Rahul Biswas (Minneapolis, MN); Sayon Majumdar (Sunnyvale, CA)
Assignee: TARGET BRANDS, INC.
G06Q10/06315G06N3/04G06N3/08G06Q30/0202
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,468,992
App. No.
17/174,667
Granted
Nov 11, 2025
Kind
B2
Abstract

Methods and systems for optimizing a product assortment, and managing product fulfillment, are disclosed. One method includes utilizing a model trained on item data to identify item substitution pairs within an item category of an item assortment, the item substitution pairs being identified as having a substitutability score above a predetermined threshold. The method further includes applying an assortment optimization model to generate an assortment recommendation for the item category at an identified retail location. A request for an item not included in the assortment recommendation may result in suggestion of an identified substitutable item from among the item substitution pairs.

Claims (101)

1 . An item assortment management system comprising:

a computing system comprising one or more processors communicatively coupled to a memory subsystem that stores instructions which, when executed, cause the one or more processors to:

obtain transactional data regarding an overall item assortment of a retail enterprise from the transactional data including transactions across the retail enterprise;

obtaining an initial item assortment and a set of constraints from a user computing device;

for items within an item category, training a model comprising a graph convolutional network suitable for weighted graphs to learn embeddings for nodes representing potentially substitutable items, the model generating a graph having edge weights corresponding to a degree of substitutability between items and being based at least in part on the transaction data and item data describing items in the item assortment;

identify one or more item substitution pairs within the item category based on the degree of substitutability being greater than a threshold;

obtain location specific item assortment parameters for an item category at an identified retail location within the retail enterprise, the retail enterprise including a plurality of retail locations, the location specific item assortment parameters including mandatory items that must be stocked within a given item category, and a minimum number of items that should be stocked for the given item category; and

generate an optimized item assortment for a retail location of the retailer, the retail location being sized to stock the optimized item assortment including fewer than all of the items in the overall item assortment, wherein the optimized item assortment is based at least in part on a set of items within the item category available at the identified retail location, a sales forecast for items in the set of items, a customer loyalty factor, the one or more item substitution pairs, and one or more physical constraints specific to the retail location;

receive a request for an item in the initial item assortment from the user computing device that is excluded from the optimized item assortment, the request being for a same-day purchase of the item from the retail location;

present, in a user interface of the user computing device, a display of a recommendation of an item within the optimized item assortment that is in stock at the retail location including at least one item excluded from the optimized item assortment, the recommendation of the item received from the graph convolutional network, by automatically displaying an element in the user interface proximate to the display of the at least one item; and

in response to selection of the user interface element, displaying in a separate region of the user interface one or more items from among the assortment recommendation determined to be substitutable for the at least one item.

2 . The item assortment management system of claim 1 , wherein the item data includes item purchase data derived from online purchase transactions.

3 . The item assortment management system of claim 1 , wherein the computing system applies item-to-item collaborative filtering to identify substitutable item pairs.

4 . The item assortment management system of claim 1 , wherein the graph convolutional network is trained based at least in part on online guest transactions.

5 . The item assortment management system of claim 4 , wherein the graph convolutional network is trained based at least in part on substitution subgraphs generated from portions of the item assortment.

6 . The item assortment management system of claim 1 , wherein the optimized item assortment is further based in part on one or more business rules including a rule defining items within the item category indicated as being mandatory to be stocked at the identified retail location.

7 . The item assortment management system of claim 1 , wherein the optimized item assortment maximizes sales volume of items across the item category subject to a business requirement of an item having an item loyalty greater than a predetermined threshold.

8 . The item assortment management system of claim 7 , wherein the optimized item assortment includes at least one substitute item from a substitutable item pair in place of another item within the substitutable item pair based at least in part on one or more of the constraints.

9 . The item assortment management system of claim 7 , wherein the optimized item assortment is determined according to:

max

i

=

i

=

1

N

x

i

s

i

+

i

=

1

N

j

=

1

N

s

i

p

ij

x

j

(

1

-

x

i

)

wherein i is the item at issue in an item category, from among items 1 to N, x is a binary indicating whether an item is included in an assortment, s is a forecasted sales volume, j represents a substitute of item i, and p represents a proportion of customers who would substitute item i for item j, subject to constraints:

i

=

1

N

x

i

MaxItemCount

i

=

1

N

x

i

MinItemCount

x

i

loyalty

i

-

loyalty

threshold

.

10 . The item assortment management system of claim 1 , wherein the request for the item comprises a request for same-day delivery of the item from the identified retail location.

11 . The item assortment management system of claim 1 , wherein the transactional data comprises user purchase data associated with the overall item assortment.

12 . The item assortment management system of claim 1 , wherein the optimized item assortment includes fewer than all items from the overall item assortment.

13 . The item assortment management system of claim 1 , wherein the optimized item assortment maximizes sales of items across the item category subject to a business requirement of an item having an item loyalty greater than a predetermined threshold.

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 8, 2025
From: PANDE, AMIT; DAS GUPTA, APARUPA; NI, KAI; BISWAS, RAHUL; MAJUMDAR, SAYON
To: TARGET BRANDS, INC.
Reel/Frame 070768/0098 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 14, 2022
From: PANDE, AMIT; DAS GUPTA, APARUPA; NI, KAI; BISWAS, RAHUL; MAJUMDAR, SAYON
To: ANDREW J. LAGATTA
Reel/Frame 058999/0827 →
Continuity (4)
Continuation In Part 16778158 · Jan 31, 2020
Provisional Application 62975592 · Feb 12, 2020
Provisional Application 62800399 · Feb 1, 2019
Related Publication 20210166179A1 · Jun 3, 2021
References Cited (58)
US 5461699A · Arbabi et al. · 1995 [cited by applicant]
US 5696907A · Tom · 1997 [cited by applicant]
US 6035284A · Straub et al. · 2000 [cited by applicant]
US 6366890B1 · Usrey · 2002 [cited by applicant]
US 7058587B1 · Horne · 2006 [cited by applicant]
US 7640169B2 · Horton · 2009 [cited by applicant]
US 8417559B2 · Joshi et al. · 2013 [cited by applicant]
US 8688598B1 · Shakes et al. · 2014 [cited by applicant]
US 10109004B1 · Hawley · 2018 [cited by examiner]
US 10134004B1 · Liberato, Jr. et al. · 2018 [cited by applicant]
US 11562039B2 · Renders · 2023 [cited by examiner]
US 20020120435A1 · Frazier et al. · 2002 [cited by applicant]
US 20030171978A1 · Jenkins et al. · 2003 [cited by applicant]
US 20040267676A1 · Feng et al. · 2004 [cited by applicant]
US 20050114196A1 · Schoenmeyr · 2005 [cited by applicant]
US 20060112028A1 · Xiao et al. · 2006 [cited by applicant]
US 20080208719A1 · Sharma et al. · 2008 [cited by applicant]
US 20090271245A1 · Joshi et al. · 2009 [cited by applicant]
US 20100306031A1 · McCauley et al. · 2010 [cited by applicant]
US 20110276364A1 · Bergstrom · 2011 [cited by examiner]
US 20140025420A1 · Joshi et al. · 2014 [cited by applicant]
US 20140058781A1 · Padmanabhan et al. · 2014 [cited by applicant]
US 20140129371A1 · Wilson et al. · 2014 [cited by applicant]
US 20150112762A1 · Lahmar et al. · 2015 [cited by applicant]
US 20150149484A1 · Kelley · 2015 [cited by applicant]
US 20160154939A1 · Grabiner et al. · 2016 [cited by applicant]
US 20160210640A1 · Wu et al. · 2016 [cited by applicant]
US 20170323367A1 · Crow · 2017 [cited by applicant]
US 20180247224A1 · Garcia Duran et al. · 2018 [cited by applicant]
US 20180315059A1 · Venkatesh · 2018 [cited by examiner]
US 20190042995A1 · Nemati et al. · 2019 [cited by applicant]
US 20190121867A1 · Misra · 2019 [cited by examiner]
US 20190140988A1 · Snider et al. · 2019 [cited by applicant]
US 20190180301A1 · Mahalanobish · 2019 [cited by examiner]
US 20190251480A1 · Garcia Duran · 2019 [cited by examiner]
US 20190286658A1 · Leskovec et al. · 2019 [cited by applicant]
US 20200005209A1 · Rangarajan et al. · 2020 [cited by applicant]
US 20200219008A1 · Franceschi et al. · 2020 [cited by applicant]
US 20200250734A1 · Pande et al. · 2020 [cited by applicant]
US 20220335501A1 · Pande et al. · 2022 [cited by applicant]
CN 108052966A · 2018 [cited by applicant]
DE 102016220723A1 · 2018 [cited by applicant]
JP 2019527865A · 2019 [cited by applicant]
WO WO03054756A2 · 2003 [cited by examiner]
WO 2017019534A1 · 2017 [cited by applicant]
WO 2017083399A2 · 2017 [cited by applicant]
Miller, Christopher et al. “Optimizing and Evaluating Retail Assortments for Infrequently Purchased Products”; Journal of Retailing, suppl. Sp Modeling Retail Phenomena 86.2: 159-171. Greenwich Elsevier Limited. (Jun. 2… [cited by examiner]
Thesis, “Online, Data Driven Learning Approaches in Operations Management Problems”; Ramamurthy, Vivek. ProQuest Dissertations and Theses ProQuest Dissertations Publishing. (2012) retrieved from Dialog on Apr. 20, 2024 … [cited by examiner]
Shin et al. “A Classification of the Literature on the Planning of Substitutable Products.” European Journal of Operational Research, vol. 246, Issue 3, Nov. 1, 2015, pp. 686-699. [cited by applicant]
William L. Hamilton et al. (Department of Computer Science, Stanford University), “Inductive Representation Learning on Large Graphs” , 31st Conference on Neural Information Processing Systems (NIPS), 2017, 11 Pages. [cited by applicant]
Rex Ying et al.(Stanford University), “Graph Convolutional Neural Networks for Web-Scale Recommender Systems” , Association for Computing Machinery, 2018, 10 Pages. [cited by applicant]
Logivations (Consulting & Technology)—AI-Based Identification Solutions in Logistics, Logivations GmbH, 2020, 8 Pages. [cited by applicant]
Noceti, et al., A multi-camera system for damage and tampering detection in a postal security framework, EURASIP Journal on Image and Video Processing ‘Research—Open Access’, Nov. 2018; 13 Pages. [cited by applicant]
Wue, Le; Sun, Peijie; Hong, Richang; Fu, Yanjie; Wang, Xiting; et al. “Social GCN: An Efficient Graph Convolutional Network based Model for Social Recommendation,”arXiv.orglthaca: Cornell University Library, arXiv.org (… [cited by applicant]
Mikolov, Tomas, et al. “Distributed representations of words and phrases and their compositionality. In Advances in neural information processing systems,” pp. 3111-3119, 2013. [cited by applicant]
Simonyan, Karen and Andrew Zisserman, Very deep convolutional networks for large-scale image recognition arXiv preprint arXiv: 1409.1556, 2014. [cited by applicant]
Pande et al., “Substitution Techniques for Grocery Fulfillment and Assortment Optimization Using Product Graphs,” MLG '20, Aug. 22-27, 2020, San Diego, CA. [cited by applicant]
Jason Brownlee “Loss and Loss Functions for Training Deep Learning Neural Networks” Jan. 28, 2019, Machine Learning Mastery (Year: 2019). [cited by applicant]