Smart Logistics for Textile Waste: Intelligent Recycling and Dynamic Path Optimization for Sustainable Development

Main Article Content

Z. H. Liu

Abstract

To improve the recycling efficiency of textile waste and reduce environmental pollution, this paper constructs a smart logistics system based on Deep Reinforcement Learning (DRL). Considering that large-scale intelligent logistics networks increasingly rely on distributed sensing, wireless communication, and reliable information transmission in electromagnetically complex environments, a Graph Neural Network (GNN) is employed to encode the state of a dynamic network composed of recycling points, vehicles, and sorting centers, capturing both node features and topological relationships. A Proximal Policy Optimization (PPO) algorithm is adopted to train multiple agents for collaborative path planning and task allocation. The model convergence is guided by a reward function that maximizes recycling benefits while minimizing energy consumption and idle distance. Experimental results demonstrate that the average recycling rate reaches 0.954, the task completion time is 65.5 minutes, and the energy consumption per unit of recycling is approximately 1.25 kWh/ton. The proposed method exhibits strong adaptability in dynamic environments and provides an efficient and feasible technical framework for intelligent textile waste recycling, while offering valuable insights for resource scheduling and cooperative optimization in communication-intensive smart systems.

Downloads

Download data is not yet available.

Article Details

How to Cite
Liu, Z. H. (2026). Smart Logistics for Textile Waste: Intelligent Recycling and Dynamic Path Optimization for Sustainable Development. Advanced Electromagnetics, 15(3), 704–711. https://doi.org/10.7716/aem.v15i3.3121
Section
Research Articles

References

A. Martikkala, B. Mayanti, P. Helo, A. Lobov, and I. Flores Ituarte, “Smart textile waste collection system–Dynamic route optimization with IoT,” Journal of Environmental Management, vol. 335, no. 1, pp. 117548-117562, 2023, doi: 10.1016/j.jenvman.2023.117548.

View Article

N. Kapadia and R. Mehta, “Dynamic route optimization for IoT based intelligent waste collection vehicle routing system,” Intelligent Decision Technologies, vol. 17, no. 3, pp. 751-772, 2023, doi: 10.3233/IDT-230032.

View Article

M. S. Abbas-Abadi, B. Tomme, B. Goshayeshi, O. Mynko, Y. Wang, S. Roy, et al., “Advancing textile waste recycling: challenges and opportunities across polymer and non-polymer fiber types,” Polymers, vol. 17, no. 5, pp. 628-637, 2025, doi: 10.3390/polym17050628.

View Article

N. Indrianti, R. A. C. Leuveano, S. H. Abdul-Rashid, and M. I. Ridho, “Green Vehicle Routing Problem Optimization for LPG Distribution: Genetic Algorithms for Complex Constraints and Emission Reduction,” Sustainability, vol. 17, no. 3, pp. 1144-1160, 2025, doi: 10.3390/su17031144.

View Article

A. Kantasa-ard, T. Chargui, A. Bekrar, A. AitElCadi, and Y. Sallez, “Dynamic sustainable multiple-depot vehicle routing problem with simultaneous pickup and delivery in the context of the physical internet,” Journal of International Logistics and Trade, vol. 21, no. 3, pp. 110-134, 2023, doi: 10.1108/JILT-10-2022-0058.

View Article

G. Ali, D. Asiku, M. M. Mijwil, I. Adamopoulos, and M. Dudek, “Fusion of Blockchain, IoT, Artificial Intelligence, and Robotics for Efficient Waste Management in Smart Cities,” International Journal of Innovative Technology and Interdisciplinary Sciences, vol. 8, no. 3, pp. 388-495, 2025, doi: 10.15157/IJITIS.2025.8.3.388-495.

View Article

S. Petchrompo, R. Chitniyom, N. Peerwantanagul, W. Laesanklang, J. Suwanapong, and S. Borrisuttanakul, “Enhancing operational efficiency in a voluntary recycling project through data-driven waste collection optimization,” Waste Management, vol. 200, no. 1, pp. 114741-114756, 2025, doi: 10.1016/j.wasman.2025.114741.

View Article

P. Gupta and D. S. Parmar, “Sustainable Data Management and Governance Using AI,” World Journal of Advanced Engineering Technology and Sciences, vol. 13, no. 2, pp. 264-274, 2024, doi: 10.30574/wjaets.2024.13.2.0551.

View Article

A. Maroof, B. Ayvaz, and K. Naeem, “Logistics optimization using hybrid genetic algorithm (hga): A solution to the vehicle routing problem with time windows (vrptw),” IEEE Access, vol. 12, no. 1, pp. 36974-36989, 2024, doi: 10.1109/ACCESS.2024.3373699.

View Article

M. Ammouriova, E. M. Herrera, M. Neroni, A. A. Juan, and J. Faulin, “Solving vehicle routing problems under uncertainty and in dynamic scenarios: From simheuristics to agile optimization,” Applied Sciences, vol. 13, no. 1, pp. 101-124, 2022, doi: 10.3390/app13010101.

View Article

G. Tresca, H. Salem, G. Cavone, H. Zgaya-Biau, S. Ben-Othman, and M. Dotoli, “A Matheuristic Approach for Delivery Planning and Dynamic Vehicle Routing in Logistics 4.0,” IEEE Transactions on Automation Science and Engineering, vol. 22, no. 1, pp. 3345-3365, 2024, doi: 10.1109/TASE.2024.3393507.

View Article

G. Sirbiladze, H. Garg, B. Ghvaberidze, B. Matsaberidze, I. Khutsishvili, and B. Midodashvili, “Uncertainty modeling in multi objective vehicle routing problem under extreme environment,” Artificial Intelligence Review, vol. 55, no. 8, pp. 6673-6707, 2022, doi: 10.1007/s10462-022-10169-6.

View Article

M. S. Sarbijan and J. Behnamian, “Real-Time collaborative feeder vehicle routing problem with flexible time windows,” Swarm and Evolutionary Computation, vol. 75, no. 1, pp. 101201-101219, 2022, doi: 10.1016/j.swevo.2022.101201.

View Article

L. N. Steimle, D. L. Kaufman, and B. T. Denton, “Multi-Model Markov decision processes,” IISE Transactions, vol. 53, no. 10, pp. 1124-1139, 2021, doi: 10.1080/24725854.2021.1895454.

View Article

C. Jenifa Latha, K. Kalaiselvi, S. Ramanarayan, R. Srivel, S. Vani, and T. V. M. Sairam, “Dynamic convolutional neural network based e-waste management and optimized collection planning,” Concurrency and Computation: Practice and Experience, vol. 34, no. 17, pp. 6941-6952, 2022, doi: 10.1002/cpe.6941.

View Article

Similar Articles

<< < 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 

You may also start an advanced similarity search for this article.