IP Library Granted Patent US 12,412,137
Granted Patent B2
US 12,412,137 · App. 18/335,570 · Granted Sep 9, 2025

Analysis and correction of supply chain design through machine learning

Inventors: Marcio Oliveira Almeida (Stittsville, CA); Zhen Lin (Kanata, CA); Behrouz Haji Soleimani (Halifax, CA); Seyednaser Nourashrafeddin (Ottawa, CA); Chantal Bisson-Krol (Kanata, CA)
Assignee: Kinaxis Inc.
G06Q10/06315G06N5/048G06N20/00G06F16/285
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,412,137
App. No.
18/335,570
Granted
Sep 9, 2025
Kind
B2
Abstract

A method and system for a machine learning duster analysis of historical lead time data, which is augmented by one or more features. The data can also be divided into groups, based on time-density of the data, with clustering performed on each group. Furthermore, clustering can also be projected onto two dimensions. In addition, the historical lead time data is separated into a plurality of tolerance zones based on tolerance criteria. The clusters are separated in accordance with a tolerance zone of each group; and further separated according to one or more lead time identifiers to provide one or more separated clusters.

Claims (54)

1. A computer-implemented method comprising:

receiving, by a processor, historical lead time data from a database;

dividing, by the processor, the historical lead time data into a first subset and a second subset;

training a plurality of machine learning forecasting algorithms on the first subset of the historical lead time data;

testing, each of the plurality of machine learning forecasting algorithms on the second subset of the historical lead time data and selecting, based on the testing, a machine learning forecasting algorithm having a highest accuracy;

retraining the selected machine learning forecasting algorithm based on the historical lead time data;

generating, by the selected machine learning forecasting algorithm, one or more lead time identifiers;

augmenting, by the processor, the historical lead time data with one or more features, the historical lead time data having a dimensionality greater than a 2-dimensional space and each of the one or more features having a dimensionality orthogonal to the dimensionality of the time historical lead time data;

projecting the historical lead time data to 2-dimensional space and reducing a noise thereof;

separating, by the processor, the historical lead time data into two or more groups based on a time density of data points comprising the historical lead time data;

selecting, by the processor, an optimal number of clusters for each of the two or more groups;

performing, by the processor, clustering on each of the two or more groups to provide a plurality of clusters, a number of clusters of the plurality of clusters for each of the two or more groups being the selected optimal number for that one of the two or more groups;

visually outputting the plurality of clusters;

receiving, by the processor, from a user via a user interface, tolerance criteria for separation of the historical lead time data into a plurality of tolerance zones;

separating, by the processor, the historical lead time data into the plurality of tolerance zones;

separating, by the processor, the plurality of clusters in accordance with a tolerance zone of each group; and

further separating, by the processor, the plurality of clusters according to the one or more lead time identifiers, to provide one or more separated clusters;

wherein separating the historical lead time data into two or more groups based on the time density comprises:

comparing a number of data points in each time series of the historical lead time data to at least one threshold, and

adding the data points of each of the time series into one group of the two or more groups based on the comparison to the at least one threshold.

2. The computer-implemented method of claim 1 , wherein the one or more features relate to linearity and seasonality.

3. The computer-implemented method of claim 2 , wherein the features are seasonality, upward linearity, flat linearity, and downward linearity.

4. The computer-implemented method of claim 1 , wherein the number of groups is three.

5. The computer-implemented method of claim 1 , further comprising:

pruning, by the processor, each cluster;

dividing, by the processor, each cluster into a plurality of subclusters.

6. A system comprising:

a processor; and

a memory storing instructions that, when executed by the processor, configure the system to:

receive, by the processor, historical lead time data from a database;

divide, by the processor, the historical lead time data into a first subset and a second subset;

train a plurality of machine learning forecasting algorithms on the first subset of the historical lead time data;

test, each of the plurality of machine learning forecasting algorithms on the second subset of the historical lead time data and select, based on the test, a machine learning forecasting algorithm having a highest accuracy;

retrain the selected machine learning forecasting algorithm based on the historical lead time data;

generate, by the selected machine learning forecasting algorithm, one or more lead time identifiers;

augment, by the processor, the historical lead time data with one or more features, the historical lead time data having a dimensionality greater than a 2-dimensional space and each of the one or more features having a dimensionality orthogonal to the dimensionality of the historical lead time data;

project the historical lead time data to 2-dimensional space and reduce a noise thereof;

separate, by the processor, the historical lead time data into two or more groups based on a time density of data points of the historical lead time data;

select, by the processor, an optimal number of clusters for each of the two or more groups;

perform, by the processor, clustering on each of the two or more groups to provide a plurality of clusters, a number of clusters of the plurality of clusters for each of the two or more groups being the selected optimal number for that one of the two or more groups;

visually output the plurality of clusters;

receive, by the processor, from a user via a user interface, tolerance criteria for separation of the historical lead time data into a plurality of tolerance zones;

separate, by the processor, the historical lead time data into the plurality of tolerance zones;

separate, by the processor, the plurality of clusters in accordance with a tolerance zone of each group; and

further separate, by the processor, the plurality of clusters according to the one or more lead time identifiers, to provide one or more separated clusters;

wherein the instructions that, when executed by the processor, configure the system to separate the historical lead time data into two or more groups based on the time density comprise instructions that, when executed by the system, configure the system to:

compare a number of data points in each time series of the historical lead time data to at least one threshold, and

add the data points of each of the time series into one group of the two or more groups based on the comparison to the at least one threshold.

7. The system of claim 6 , wherein the one or more features relate to linearity and seasonality.

8. The system of claim 7 , wherein the features are seasonality, upward linearity, flat linearity, and downward linearity.

9. The system of claim 6 , wherein the number of groups is three.

10. The system of claim 6 , wherein the instructions further configure the system to:

prune, by the processor, each cluster;

divide, by the processor, each cluster into a plurality of subclusters.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 19, 2023
From: OLIVEIRA ALMEIDA, MARCIO; LIN, ZHEN; HAJI SOLEIMANI, BEHROUZ; NOURASHRAFEDDIN, SEYEDNASER; BISSON-KROL, CHANTAL
To: KINAXIS INC.
Reel/Frame 063984/0484 →
Continuity (5)
Continuation 17485781 · Sep 27, 2021
Continuation 17060225 · Oct 1, 2020
Continuation 16147311 · Sep 28, 2018
Provisional Application 62725345 · Aug 31, 2018
Related Publication 20230325743A1 · Oct 12, 2023
References Cited (95)
US 6496806B1 · Horwitz et al. · 2002 [cited by applicant]
US 6611726B1 · Crosswhite · 2003 [cited by applicant]
US 8428987B2 · Najmi et al. · 2013 [cited by applicant]
US 8494823B2 · Ding et al. · 2013 [cited by applicant]
US 8600981B1 · Chau et al. · 2013 [cited by applicant]
US 8942913B2 · Hota · 2015 [cited by examiner]
US 9600779B2 · Hoover et al. · 2017 [cited by applicant]
US 9721295B1 · Miller et al. · 2017 [cited by applicant]
US 10032180B1 · Shariff et al. · 2018 [cited by applicant]
US 10846651B2 · Oliveira Almeida et al. · 2020 [cited by applicant]
US 20020138316A1 · Katz · 2002 [cited by examiner]
US 20020138358A1 · Scheer · 2002 [cited by applicant]
US 20020143604A1 · Cox et al. · 2002 [cited by applicant]
US 20030061213A1 · Yu et al. · 2003 [cited by applicant]
US 20050171825A1 · Denton et al. · 2005 [cited by applicant]
US 20070143156A1 · Van Deursen · 2007 [cited by applicant]
US 20070203810A1 · Grichnik · 2007 [cited by applicant]
US 20080065436A1 · Wu et al. · 2008 [cited by applicant]
US 20100114554A1 · Misra · 2010 [cited by applicant]
US 20100125486A1 · Sinclair et al. · 2010 [cited by applicant]
US 20100138264A1 · Faris et al. · 2010 [cited by applicant]
US 20100153870A1 · Hoffmann · 2010 [cited by applicant]
US 20100283666A1 · Lee · 2010 [cited by examiner]
US 20120076283A1 · Ajmera et al. · 2012 [cited by applicant]
US 20120173456A1 · Hirl · 2012 [cited by applicant]
US 20140105262A1 · Alloin · 2014 [cited by examiner]
US 20140122179A1 · Chan · 2014 [cited by examiner]
US 20140143249A1 · Cazzanti · 2014 [cited by examiner]
US 20140192050A1 · Qiu et al. · 2014 [cited by applicant]
US 20150046361A1 · Williams et al. · 2015 [cited by applicant]
US 20150066552A1 · Shami · 2015 [cited by applicant]
US 20160027026A1 · Matsui et al. · 2016 [cited by applicant]
US 20160048852A1 · Beh et al. · 2016 [cited by applicant]
US 20160299255A1 · Dail et al. · 2016 [cited by applicant]
US 20160328670A1 · Adam et al. · 2016 [cited by applicant]
US 20160371618A1 · Leidner et al. · 2016 [cited by applicant]
US 20170006135A1 · Siebel et al. · 2017 [cited by applicant]
US 20170011560A1 · Sheldon et al. · 2017 [cited by applicant]
US 20170017896A1 · Hamann et al. · 2017 [cited by applicant]
US 20170063909A1 · Muddu et al. · 2017 [cited by applicant]
US 20170124495A1 · Saxena et al. · 2017 [cited by applicant]
US 20170154347A1 · Bateman · 2017 [cited by applicant]
US 20170191847A1 · Chintakindi et al. · 2017 [cited by applicant]
US 20170236060A1 · Ignatyev · 2017 [cited by applicant]
US 20170262764A1 · Karuppasamy · 2017 [cited by applicant]
US 20180017406A1 · Semnani · 2018 [cited by examiner]
US 20180101814A1 · Nadella · 2018 [cited by examiner]
US 20180123909A1 · Venkitapathi et al. · 2018 [cited by applicant]
US 20180150547A1 · Pallath et al. · 2018 [cited by applicant]
US 20180174219A1 · Jadhav et al. · 2018 [cited by applicant]
US 20180203915A1 · Marshall et al. · 2018 [cited by applicant]
US 20180285691A1 · Grindstaff et al. · 2018 [cited by applicant]
US 20180322462A1 · Jayaraman et al. · 2018 [cited by applicant]
US 20190087247A1 · Chakraborty et al. · 2019 [cited by applicant]
US 20190087733A1 · Dooley et al. · 2019 [cited by applicant]
US 20190095842A1 · Brousseau · 2019 [cited by examiner]
US 20190156298A1 · Ethington · 2019 [cited by examiner]
US 20190171194A1 · Sato et al. · 2019 [cited by applicant]
US 20190198136A1 · Hou et al. · 2019 [cited by applicant]
US 20190227193A1 · Caruzzo et al. · 2019 [cited by applicant]
US 20190258978A1 · Mahajan et al. · 2019 [cited by applicant]
AU 2003298877A1 · 2004 [cited by applicant]
CA 2981748A1 · 2018 [cited by applicant]
CN 106991593A · 2017 [cited by applicant]
CN 109740624A · 2019 [cited by examiner]
CN 110503225A · 2019 [cited by applicant]
WO 2015191443A1 · 2015 [cited by applicant]
de Oliveira et al. “Lead Time Forecasting with Machine Learning Techniques for a Pharmaceutical Supply Chain” (2021) (DOI: 10.5220/0010434406340641 In Proceedings of the 23rd International Conference on Enterprise Infor… [cited by examiner]
Berlec et al., “Predicting Order Lead Times,”Journal of Mechanical Engineering, Sep. 2007, vol. 54(2008)5, pp. 308-321. [cited by applicant]
International Patent Application No. PCT/CA2019/051222, International Preliminary Report on Patentability dated Mar. 11, 2021. [cited by applicant]
International Patent Application No. PCT/CA2019/051223, International Preliminary Report on Patentability dated Dec. 7, 2020. [cited by applicant]
International Patent Application No. PCT/CA2019/051223 International Search Report and Written Opinion dated Nov. 28, 2019. [cited by applicant]
International Search Report from related international application No. PCT/CA2019/051222. [cited by applicant]
Kharfan et al., Forecasting Seasonal Footwear Demand Using Machine Learning, 2018, (https://dspace.mit.edu/bitstream/handle/1721.1/117612/Chan_Kharfan_2018_Capstone.pdf?sequence=1). [cited by applicant]
Lingitz et al., “Lead Time Prediction Using Machine Learning Algorithms: a Case Study by a Semiconductor Manufacturer,”51st CIPR Conference on Manufacturing Systems, Procedia CIRP, vol. 72 (2018), pp. 1051-1056. [cited by applicant]
Plex DemandCaster “What Is Lead Time Variability and How Can You Beat It?” (2018) (https://www.plex.com/blog/what-lead-time-variability-and-how-can-you-beat-it) (Year: 2018). [cited by applicant]
United Kingdom Patent Application No. GB2102941.8, Office Action dated Apr. 1, 2022. [cited by applicant]
U.S. Appl. No. 16/147,311, Non-Final Office Action dated Jun. 15, 2020. [cited by applicant]
U.S. Appl. No. 16/147,311 Notice of Allowance dated Jul. 27, 2020. [cited by applicant]
U.S. Appl. No. 16/223,938, Non-Final Office Action dated Aug. 27, 2020. [cited by applicant]
U.S. Appl. No. 16/223,938 Notice of Allowance dated Sep. 10, 2020. [cited by applicant]
U.S. Appl. No. 17/060,225, Non-Final Office Action dated Sep. 20, 2021. [cited by applicant]
U.S. Appl. No. 17/060,225 Notice of Allowance dated Oct. 21, 2021. [cited by applicant]
U.S. Appl. No. 17/061,422, Non-Final Office Action dated Oct. 22, 2021. [cited by applicant]
U.S. Appl. No. 17/061,422 Notice of Allowance dated Feb. 11, 2022. [cited by applicant]
U.S. Appl. No. 17/485,781, Non Final office Action dated Oct. 19, 2022. [cited by applicant]
U.S. Appl. No. 17/485,781, Notice of Allowance dated Jul. 11, 2023. [cited by applicant]
U.S. Appl. No. 17/485,781, Notice of Allowance dated Mar. 22, 2023. [cited by applicant]
U.S. Appl. No. 17/740,869, Non-Final office Action dated Jun. 13, 2023. [cited by applicant]
U.S. Appl. No. 17/740,869, Notice of Allowance dated Sep. 20, 2023. [cited by applicant]
U.S. Appl. No. 18/538,382, Non-Final Office Action dated Jul. 1, 2024. [cited by applicant]
Wood., “The Role of Clusters in Creating Value in Supply Chains: Evidence from the Examination of Clusters with RBV” School of Information Systems, Curtin University of Technology, 2010, pp. 1-18. Retrieved from Interne… [cited by applicant]
U.S. Appl. No. 18/538,382, Final Office Action dated Oct. 1, 2024. [cited by applicant]
U.S. Appl. No. 18/538,382, Notice of Allowance dated Apr. 2, 2025. [cited by applicant]
U.S. Appl. No. 18/538,382, Non-Final office Action dated Jan. 21, 2025. [cited by applicant]