IDEAS home Printed from https://ideas.repec.org/a/alk/fcsai0/v4y2025i1id13736.html

Graph neural network-based prediction of cascading supply chain disruptions using real-time logistics and supplier risk data

Author

Listed:
  • Ramu Mannava

    (Devfi INC, USA)

  • Jyothinadh Nadella

    (Devfi INC, USA)

  • Gangadhar Reddy Bhimireddy

    (Capgemini, USA)

  • Bhagam Ravi Teja

    (Volantsoft Inc, USA)

Abstract

Cascading supply chain disruptions arise when a localized failure propagates through supplier, production, transportation, and distribution dependencies, so that the eventual operational impact is determined by both the condition of individual firms and the structure of the network connecting them. Conventional risk scores and stand-alone time-series models are limited in this setting because they usually treat suppliers as independent observations and therefore fail to represent higher-order exposure. This paper develops a graph neural network-based framework for predicting near-term node-level disruptions by integrating relatively slow-moving supplier risk indicators with high-frequency logistics signals. The supply chain is represented as a directed, weighted, time-indexed graph in which nodes denote firms or facilities, edges encode material or logistics dependencies, node attributes include financial, geopolitical, concentration, quality, lead-time, and resilience indicators, and dynamic observations include delay, congestion, capacity stress, demand volatility, inventory pressure, estimated-time-of-arrival variance, and exogenous shocks. An edge-weighted graph encoder learns structural exposure, while a gated recurrent unit summarizes the temporal evolution of graph states. Because no public benchmark currently combines complete multi-tier supplier relationships with synchronized real-time logistics and verified disruption labels, the empirical section uses a reproducible semi-synthetic network designed to emulate these data-generating conditions without presenting simulated observations as real company data. On a held-out temporal test period, graph-aware models achieved stronger discrimination than non-graph baselines. The temporal GCN-GRU obtained an AUROC of 0.844, AUPRC of 0.546, recall of 0.710, and F1 score of 0.592, while a snapshot GCN achieved the highest AUROC of 0.845 and AUPRC of 0.552. Ablation analysis showed that removing network propagation reduced AUROC to 0.810 and removing real-time logistics signals reduced AUROC to 0.825. The results support a central conclusion: supply chain disruption prediction benefits materially from representing inter-firm dependency as a graph, but temporal complexity should be added only when the data resolution and propagation lags justify it. The paper concludes with deployment guidance covering graph construction, calibration, explanation, data governance, concept drift, and integration with digital supply chain twins. Graph Neural Networks, Supply Chain Disruption, Cascading Failure, Ripple Effect, Supplier Risk, Real-Time Logistics, Temporal Graph Learning, Supply Chain Resilience, Risk Propagation, Digital Supply Chain Twin.

Suggested Citation

  • Ramu Mannava & Jyothinadh Nadella & Gangadhar Reddy Bhimireddy & Bhagam Ravi Teja, 2025. "Graph neural network-based prediction of cascading supply chain disruptions using real-time logistics and supplier risk data," Frontiers in Computer Science and Artificial Intelligence, Al-Kindi Center for Research and Development, vol. 4(1), pages 98-113, November.
  • Handle: RePEc:alk:fcsai0:v:4:y:2025:i:1:id:13736
    DOI: 10.32996/fcsai.2025.4.1.8
    as

    Download full text from publisher

    File URL: https://al-kindipublisher.com/index.php/fcsai/article/view/13736
    File Function: Abstract page
    Download Restriction: no

    File URL: https://al-kindipublisher.com/index.php/fcsai/article/download/13736/12470
    File Function: Full text
    Download Restriction: no

    File URL: https://libkey.io/10.32996/fcsai.2025.4.1.8?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:alk:fcsai0:v:4:y:2025:i:1:id:13736. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Al-Kindi Center for Research and Development (email available below). General contact details of provider: https://al-kindipublisher.com/index.php/fcsai .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.