IP Library Granted Patent US 12,346,876
Granted Patent B2
US 12,346,876 · App. 18/165,184 · Granted Jul 1, 2025

Intelligent prediction of bundles of spare parts

Inventors: Zhennong Wang (Bellevue, WA); Yun Shi (Bellevue, WA)
Assignee: The Boeing Company
G06Q10/0875G06Q10/063G06Q30/0201G06Q30/0202G06Q30/0633G06Q10/0838
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,346,876
App. No.
18/165,184
Granted
Jul 1, 2025
Kind
B2
Abstract

Techniques for intelligently predicting bundles of replacement parts. These techniques include determining a plurality of maintenance events for a plurality of replacement parts. The determining includes identifying one or more replacement parts for a maintenance event, based on one or more replacement part events occurring within a time period related to the maintenance event. The techniques further include generating one or more clusters of replacement parts based on the plurality of maintenance events, and predicting one or more bundles of replacement parts, based on the clusters, wherein each bundle comprises a plurality of replacement parts.

Claims (56)

1. A method for bundling parts, the method, comprising:

determining, using a computer processor, a plurality of maintenance events for a plurality of replacement parts, the determining comprising:

identifying, using the computer processor, one or more replacement parts for a maintenance event, based on one or more replacement part events occurring within a time period related to the maintenance event, wherein the time period relating to the maintenance event comprises a time period relating to a starting point in time for the maintenance event and an ending point in time for the maintenance event;

generating, using the computer processor, a two dimensional array relating to the plurality of maintenance events and the plurality of replacement parts;

generating, using the computer processor, one or more clusters of replacement parts based on the plurality of maintenance events and the two dimensional array;

calculating a local weight for a plurality of entries in the two dimensional array;

calculating a global weight for the plurality of entries in the two dimensional array;

reducing a dimension of the two dimensional array, based at least in part on the calculated local weights and global weights;

predicting, using the computer processor, one or more bundles of replacement parts, based on the clusters, wherein each bundle comprises a plurality of replacement parts necessary to complete a task;

bundling together, in each bundle as predicted, the plurality of replacement parts; and

responding to receiving a search comprising a replacement part in the bundle or of the task, by transmitting a bundle as predicted through an output device.

2. The method of claim 1 , wherein the one or more replacement part events comprise sales of replacement parts.

3. The method of claim 1 , wherein determining, using the computer processor, the plurality of maintenance events for the plurality of replacement parts further comprises generating time series data related to historical data relating to the plurality of replacement parts.

4. The method of claim 3 , further comprising calculating a kernel density estimate related to the time series data, wherein the time period related to the maintenance event is based on the kernel density estimate.

5. The method of claim 4 , wherein the two dimensional array is a binary array.

6. The method of claim 4 , wherein the one or more replacement part events comprise electronic searches for replacement parts.

7. The method of claim 1 , further comprising:

identifying, using the computer processor, a plurality of interchangeable parts among the plurality of replacement parts, wherein the plurality of maintenance events is based on the plurality of interchangeable parts.

8. The method of claim 7 , further comprising:

determining, using the computer processor, for a first interchangeable part of the plurality of interchangeable parts, an original part identifier and a most recent part identifier, wherein the plurality of maintenance events uses the most recent part identifier in place of the original part identifier.

9. The method of claim 1 , further comprising:

determining a price for a first bundle of the one or more bundles of replacement parts, based at least in part on pre-determined prices for each part in the first bundle, wherein the price for the first bundle is lower than combined pre-determined prices for each part in the first bundle.

10. The method of claim 9 , wherein the price for the first bundle is determined automatically, using the computer processor, and wherein the price for the first bundle is based on one or more characteristics of parts in the first bundle.

11. A system that comprises:

a processor; and

a program stored in a memory and configured to determine a plurality of maintenance events for a plurality of replacement parts based upon operations executed by the processor that comprise:

identifying one or more replacement parts for a maintenance event, based on one or more replacement part events occurring within a time period related to the maintenance event, wherein the time period relating to the maintenance event comprises a time period relating to a starting point in time for the maintenance event and an ending point in time for the maintenance event;

generating a two dimensional array relating to the plurality of maintenance events and the plurality of replacement parts;

generating one or more clusters of replacement parts based on the plurality of maintenance events and the two dimensional array;

calculating a local weight for a plurality of entries in the two dimensional array;

calculating a global weight for the plurality of entries in the two dimensional array;

reducing a dimension of the two dimensional array, based at least in part on the calculated local weights and global weights;

predicting one or more bundles of replacement parts, based on the clusters, wherein each bundle comprises a plurality of replacement parts necessary to complete a task;

bundling together, in each bundle as predicted, the plurality of replacement parts; and

responding to receiving a search, comprising a replacement part in the bundle or of the task, by transmitting the bundle as predicted through an output device.

12. The system of claim 11 , wherein the one or more replacement part events comprise at least one of sales of replacement parts or electronic searches for replacement parts.

13. The system of claim 11 , wherein determining the plurality of maintenance events for the plurality of replacement parts further comprises:

generating time series data related to historical data relating to the plurality of replacement parts; and

calculating a kernel density estimate related to the time series data, wherein the time period related to the maintenance event is based on the kernel density estimate.

14. The system of claim 11 , wherein the program is further configured to identify a plurality of interchangeable parts among the plurality of replacement parts, wherein the plurality of maintenance events is based on the plurality of interchangeable parts.

15. The system of claim 11 , wherein the program is further configured to determine a price for a first bundle of the one or more bundles of replacement parts, based at least in part on pre-determined prices for each part in the first bundle, wherein the price for the first bundle is lower than combined pre-determined prices for each part in the first bundle.

16. The system of claim 15 , wherein the price for the first bundle is determined automatically and wherein the price for the first bundle is based on one or more characteristics of parts in the first bundle.

17. A computer program product, that comprises a non-transitory computer-readable storage medium that comprises a computer-readable program code embodied therewith configured to execute operations on one or more computer processors, that determine a plurality of maintenance events for a plurality of replacement parts based upon operations that comprise:

identifying one or more replacement parts for a maintenance event, based on one or more replacement part events occurring within a time period related to the maintenance event, wherein the time period relating to the maintenance event comprises a time period relating to a starting point in time for the maintenance event and an ending point in time for the maintenance event;

generating a two dimensional array relating to the plurality of maintenance events and the plurality of replacement parts;

generating one or more clusters of replacement parts based on the plurality of maintenance events and the two dimensional array;

calculating a local weight for a plurality of entries in the two dimensional array;

calculating a global weight for the plurality of entries in the two dimensional array;

reducing a dimension of the two dimensional array, based at least in part on the calculated local weights and global weights;

predicting one or more bundles of replacement parts, based on the clusters, wherein each bundle comprises a plurality of replacement parts necessary to complete a task;

bundling together, in each bundle as predicted, the plurality of replacement parts; and

responding to receiving a search, comprising a replacement part in the bundle or of the task, by transmitting the bundle as predicted through an output device.

18. The computer program product of claim 17 , wherein the one or more replacement part events comprise at least one of sales of replacement parts or electronic searches for replacement parts.

19. The computer program product of claim 17 , the operations further comprising:

determining a price for a first bundle of the one or more bundles of replacement parts, based at least in part on pre-determined prices for each part in the first bundle, wherein the price for the first bundle is lower than combined pre-determined prices for each part in the first bundle.

20. The computer program product of claim 19 , wherein the price for the first bundle is determined automatically and wherein the price for the first bundle is based on one or more characteristics of parts in the first bundle.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 6, 2023
From: WANG, ZHENNONG; SHI, YUN
To: THE BOEING COMPANY
Reel/Frame 062605/0934 →
Continuity (3)
Continuation 17175991 · Feb 15, 2021
Continuation 16145731 · Sep 28, 2018
Related Publication 20230186238A1 · Jun 15, 2023
References Cited (39)
US 6058227A · Wong · 2000 [cited by applicant]
US 8185446B1 · Kuznetsova et al. · 2012 [cited by applicant]
US 8401986B1 · Franke · 2013 [cited by applicant]
US 9292040B2 · Marwah · 2016 [cited by examiner]
US 10127498B2 · Jeffries · 2018 [cited by examiner]
US 10281363B2 · Vitullo · 2019 [cited by examiner]
US 10387922B2 · Gopalsamy et al. · 2019 [cited by applicant]
US 10521812B2 · Pirnack et al. · 2019 [cited by applicant]
US 10733577B2 · Nakazato · 2020 [cited by examiner]
US 10922650B2 · Wang et al. · 2021 [cited by applicant]
US 11250377B2 · Cappitelli et al. · 2022 [cited by applicant]
US 11574285B2 · Wang · 2023 [cited by examiner]
US 20070112618A1 · Krneta · 2007 [cited by examiner]
US 20120226573A1 · Zakas et al. · 2012 [cited by applicant]
US 20140279169A1 · Leos · 2014 [cited by applicant]
US 20140325251A1 · Marwah · 2014 [cited by examiner]
US 20140358665A1 · Gopalsamy et al. · 2014 [cited by applicant]
US 20160364683A1 · Lyons · 2016 [cited by examiner]
US 20170185970A1 · Nakazato · 2017 [cited by examiner]
US 20170193592A1 · Avidan · 2017 [cited by examiner]
US 20170276571A1 · Vitullo · 2017 [cited by examiner]
US 20170345040A1 · Pirnack et al. · 2017 [cited by applicant]
US 20200042930A1 · Cappitelli et al. · 2020 [cited by applicant]
CN 106096803A · 2016 [cited by applicant]
KR 20060105748A · 2006 [cited by applicant]
KR 20080026336A · 2008 [cited by applicant]
Harvey, A., et al., “Kernel density estimation for time series data,” preprint submitted to International Journal of Forecasting, Feb. 17, 2010 (Year: 2010). [cited by examiner]
Hassan, J., et al., “A risk-based approach to manage non-repairable spare parts inventory,” Journal of Quality in Maintenance Engineering, 18.3: 344-362, Emerald Group Publishing limited. 2012. (Year: 2012). [cited by examiner]
Tsang, A.H.C., et al., “Data Management for CBM optimization,” Journal of Quality in Maintenance Engineering 12.1: 37-51, Emerald Group Publishing Limited. (Year: 2006). [cited by examiner]
Shalash, S., “Building Upgrade Blitz Winds Down,” Daily Press [Newport News, Va) Aug. 12, 2008: A.1. (Year: 2008). [cited by examiner]
Anonymous, “Automotive hall of famers,” Edmonton Journal [Edmonton, Alberta], Apr. 16, 2010: F.13. (Year: 2010). [cited by examiner]
Popkowski Leszczyc, P.T.L. et al., “To Bundle or Not to Bundle: Determinants of the Profitability of Multi-item Auctions,” Journal of Marketing, vol. 74 (Jul. 2010), 110-124. (Year: 2010). [cited by examiner]
Korean Patent Office, Notice of Final Rejection for Application 10-2019-0098212 dated Nov. 7, 2023. [cited by applicant]
European Patent Office Extended European Search Report for Application No. 19195084.9-1222 dated Oct. 2, 2019. [cited by applicant]
European Patent Office Examination Report for Application No. 19 195 084.9-1222 dated Feb. 22, 2021. [cited by applicant]
European Patent Office, Summons to attend oral proceedings pursuant to Rule 115(1) EPC for Application 19 195 084.9 dated Nov. 5, 2021, pp. 1-10. [cited by applicant]
Rezig, S., et al., “Using Data Mining Methods for Predicting Sequential Maintenance Activities,” Applied Sciences 8.11 MDPI AG. (Nov. 2018). (Year: 2018). [cited by applicant]
Korean Patent Office, Notice to File a Response for Application 10-2019-0098212 dated May 19, 2023. [cited by applicant]
China National Intellectual Property Administration, First Office Action for Chinese Patent Application No. 201910758304.7, dated Jul. 18, 2024. [cited by applicant]