Adaptive Graph Learning for Joint Optimization of Speed and Quality in Supply Chains

0Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Balancing rapid delivery with strict quality compliance is a critical challenge in healthcare logistics. To address this, we propose an Adaptive Graph Learning framework centered on the dynamic joint optimization of speed and quality. Unlike traditional static models, our approach models the supply chain as an evolving, multi-relational graph. By ingesting heterogeneous operational data - such as delivery velocity and temperature volatility - into a unified representation, we introduce a Dynamic Multi-Modal Weighting mechanism. This mechanism uses reinforcement learning to automatically recalibrate the trade-off between temporal urgency and condition stability in response to real-time network disruptions. Furthermore, we employ graph attention networks to identify functionally robust supply communities, enabling targeted, facility-level optimizations. Extensive empirical evaluations on large-scale healthcare datasets validate our framework's efficacy. Notably, a real-world case study demonstrates a 37.8% reduction in emergency response time and a 68.3% reduction in quality defect rates. These results confirm that our adaptive approach significantly enhances supply chain resilience, providing a scalable, intelligent foundation for modern logistics.

Cite

CITATION STYLE

APA

Wei, Z., Jing, Z., & Guanghui, C. (2026). Adaptive Graph Learning for Joint Optimization of Speed and Quality in Supply Chains. IEEE Access, 14, 77075–77086. https://doi.org/10.1109/ACCESS.2026.3693869

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free