Zuowen Jiang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Zuowen Jiang has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Chunhong Yuan
Faculty of Control Systems and Robotics, ITMO University, St. Petersburg, Russia
2 shared publications Chuan Zhang
1 shared publication- Huanbo Zhang
Department of Computing, Faculty of Computer and Mathematical Sciences, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong SAR 999077, China
1 shared publication Jinxian Zhang
1 shared publication- Libo Xu
School of Informatic, Xiamen University, Xiamen 361102, China
1 shared publication - Ting Luo
Ningbo University
1 shared publication
Latest Publications
- 18 September 2026
- Published by Elsevier in Journal of Visual Communication and Image Representation
- Vol. 121
TIIS: Transformer-based invertible neural network for image steganography
- 18 September 2026
- Published by Elsevier in Journal of Visual Communication and Image Representation
- Vol. 121
TIIS: Transformer-based invertible neural network for image steganography
- Top Cited PapersOpen Access
An Efficient Scheduling Method in Supply Chain Logistics Based on Network Flow
In the evolving digital landscape, network flow models have become integral to various sectors, including supply chain management. This research develops a robust network flow model for semiconductor wafer supply chains, optimizing resource allocation and addressing maximum flow challenges in production and logistics. The model incorporates the stochastic nature of wafer batch transfers and employs a dual-layer optimization framework to reduce variability and exceedance probabilities in finished goods. Empirical comparisons reveal significant enhancements in cost efficiency, productivity, and resource utilization, with a 20% reduction in time and production costs and a 10% increase in transportation and storage capacities. The model’s efficacy is underscored by a 15% decrease in transportation time and a 6700 kg increase in total capacity, demonstrating its capability to resolve logistical bottlenecks in semiconductor manufacturing. This study concludes that network flow models are a potent tool for optimizing supply chain logistics and offer a 23% improvement in resource utilization along with a 13% boost in accuracy. The findings provide valuable insights for supply chain logistics optimization.
Top Cited PapersOpen AccessAn Efficient Scheduling Method in Supply Chain Logistics Based on Network Flow
In the evolving digital landscape, network flow models have become integral to various sectors, including supply chain management. This research develops a robust network flow model for semiconductor wafer supply chains, optimizing resource allocation and addressing maximum flow challenges in production and logistics. The model incorporates the stochastic nature of wafer batch transfers and employs a dual-layer optimization framework to reduce variability and exceedance probabilities in finished goods. Empirical comparisons reveal significant enhancements in cost efficiency, productivity, and resource utilization, with a 20% reduction in time and production costs and a 10% increase in transportation and storage capacities. The model’s efficacy is underscored by a 15% decrease in transportation time and a 6700 kg increase in total capacity, demonstrating its capability to resolve logistical bottlenecks in semiconductor manufacturing. This study concludes that network flow models are a potent tool for optimizing supply chain logistics and offer a 23% improvement in resource utilization along with a 13% boost in accuracy. The findings provide valuable insights for supply chain logistics optimization.
- Top Cited PapersOpen Access
- 23 February 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (5) , 717
Multi-Strategy Enhanced Secret Bird Optimization Algorithm for Solving Obstacle Avoidance Path Planning for Mobile Robots
Mobile robots play a pivotal role in advancing smart manufacturing technologies. However, existing Obstacle avoidance path Planning (OP) algorithms for mobile robots suffer from low stability and applicability. Therefore, this paper proposes an enhanced Secret Bird Optimization Algorithm (SBOA)-based OP algorithm for mobile robots to address these challenges, termed AGMSBOA. Firstly, an adaptive learning strategy is introduced, where individuals enhance the diversity of the algorithm’s population by summarizing relationships among candidates of varying quality, thereby strengthening the algorithm’s ability to locate globally optimal obstacle avoidance path regions. Secondly, a group learning strategy is incorporated by dividing the population into learning and teaching groups, enhancing the algorithm’s exploitation capabilities, improving the accuracy of obstacle avoidance path planning, and reducing actual runtime. Lastly, a multiple population evolution strategy is proposed, which balances the exploration/exploitation phases of the algorithm by analyzing the nature of different individuals, improving the algorithm’s ability to escape suboptimal obstacle avoidance path traps. Subsequently, AGMSBOA was used to solve the OP problem on five maps and two OP problems in real-world environments. The experiments illustrate that AGMSBOA achieves more than 5% performance improvement in path length and a 100–win rate in runtime metrics, as well as faster convergence and stability of the solution. Therefore, AGMSBOA proposed in this paper is an efficient, robust, and robust OP method for mobile robots.
- 23 February 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (5) , 717
Top Cited PapersOpen AccessMulti-Strategy Enhanced Secret Bird Optimization Algorithm for Solving Obstacle Avoidance Path Planning for Mobile Robots
Mobile robots play a pivotal role in advancing smart manufacturing technologies. However, existing Obstacle avoidance path Planning (OP) algorithms for mobile robots suffer from low stability and applicability. Therefore, this paper proposes an enhanced Secret Bird Optimization Algorithm (SBOA)-based OP algorithm for mobile robots to address these challenges, termed AGMSBOA. Firstly, an adaptive learning strategy is introduced, where individuals enhance the diversity of the algorithm’s population by summarizing relationships among candidates of varying quality, thereby strengthening the algorithm’s ability to locate globally optimal obstacle avoidance path regions. Secondly, a group learning strategy is incorporated by dividing the population into learning and teaching groups, enhancing the algorithm’s exploitation capabilities, improving the accuracy of obstacle avoidance path planning, and reducing actual runtime. Lastly, a multiple population evolution strategy is proposed, which balances the exploration/exploitation phases of the algorithm by analyzing the nature of different individuals, improving the algorithm’s ability to escape suboptimal obstacle avoidance path traps. Subsequently, AGMSBOA was used to solve the OP problem on five maps and two OP problems in real-world environments. The experiments illustrate that AGMSBOA achieves more than 5% performance improvement in path length and a 100–win rate in runtime metrics, as well as faster convergence and stability of the solution. Therefore, AGMSBOA proposed in this paper is an efficient, robust, and robust OP method for mobile robots.