Modelling and solving sustainable supply chain network design based on graph autoencoder clustering algorithm.

Saved in:
Bibliographic Details
Title: Modelling and solving sustainable supply chain network design based on graph autoencoder clustering algorithm.
Authors: Guo, Yuhan1 (AUTHOR) yuhan.guo@zust.edu.cn, Chen, Runsheng2 (AUTHOR), Boulaksil, Youssef3 (AUTHOR), Allaoui, Hamid4 (AUTHOR)
Source: International Journal of Production Research. Dec2025, Vol. 63 Issue 24, p10000-10026. 27p.
Subjects: Sustainable development, Sustainability, Graph neural networks, Mathematical models, Logistics, Supply chains, Clustering algorithms
Abstract: The modelling of Sustainable Supply Chain Network Design (SSCND) is evolving significantly with increasing problem diversity and complexity. Existing algorithms face substantial challenges in accommodating various models and effectively handling large-scale instances. To address these challenges, we propose an intercity distances supply chain network model to reflect real-world scenarios, and develop a clustering mapping algorithm based on Graph Autoencoder (GAE) to solve the model. The mathematical model incorporates both economic and environmental sustainability dimensions, while also including supply chain responsiveness metrics. The algorithm operates by abstracting attribute information of supply chain potential participants, generating sparse graphs, and applying GAE clustering to create abstract nodes. The classified abstract nodes are then processed using the simplex method to generate preliminary solutions, which are subsequently mapped back into real-world solutions through a mapping mechanism. Experimental results demonstrate the high efficiency and stability of the proposed approach. For large-scale instances, it produces high-quality solutions in substantially less time compared to commercial solvers like CPLEX, offering a novel and practical approach for enterprises addressing sustainable supply chain design challenges. [ABSTRACT FROM AUTHOR]
Copyright of International Journal of Production Research is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Full text is not displayed to guests.
Description
Abstract:The modelling of Sustainable Supply Chain Network Design (SSCND) is evolving significantly with increasing problem diversity and complexity. Existing algorithms face substantial challenges in accommodating various models and effectively handling large-scale instances. To address these challenges, we propose an intercity distances supply chain network model to reflect real-world scenarios, and develop a clustering mapping algorithm based on Graph Autoencoder (GAE) to solve the model. The mathematical model incorporates both economic and environmental sustainability dimensions, while also including supply chain responsiveness metrics. The algorithm operates by abstracting attribute information of supply chain potential participants, generating sparse graphs, and applying GAE clustering to create abstract nodes. The classified abstract nodes are then processed using the simplex method to generate preliminary solutions, which are subsequently mapped back into real-world solutions through a mapping mechanism. Experimental results demonstrate the high efficiency and stability of the proposed approach. For large-scale instances, it produces high-quality solutions in substantially less time compared to commercial solvers like CPLEX, offering a novel and practical approach for enterprises addressing sustainable supply chain design challenges. [ABSTRACT FROM AUTHOR]
ISSN:00207543
DOI:10.1080/00207543.2025.2542506