Zhang Chong, Wang Longge, He Ketai
School of Mechanical Engineering, University of Science and Technology Beijing, Beijing, 100083, China.
Sci Rep. 2025 Jul 17;15(1):26001. doi: 10.1038/s41598-025-10040-y.
Service composition in cloud manufacturing is a critical optimization problem that must balance multiple conflicting objectives, including service quality, cost, and service association impact. However, existing approaches often overlook the quantitative impact of service associations on composition performance, leading to suboptimal solutions. To address this issue, this study introduces a service association cost function and develops a three-objective optimization model that explicitly accounts for service quality, cost, and service association effects. To efficiently solve this model, we propose an enhanced NSGA-II algorithm with the following key improvements: (1) Good point set-based population initialization, integrating good point sets and random sampling to enhance solution diversity and search efficiency. (2) Reverse learning-based crossover operator, designed to improve exploration capability and prevent premature convergence. (3) Adaptive dynamic elitism strategy, which dynamically adjusts the elite retention ratio and adaptively incorporates local search operators to balance convergence and diversity. Extensive experiments on both benchmark problems and cloud service composition scenarios demonstrate that the proposed algorithm outperforms conventional multi-objective optimization methods in terms of convergence, diversity, and robustness. These findings confirm the effectiveness of our approach and its practical applicability in real-world cloud manufacturing environments.
云制造中的服务组合是一个关键的优化问题,必须平衡多个相互冲突的目标,包括服务质量、成本和服务关联影响。然而,现有方法往往忽视了服务关联对组合性能的定量影响,导致解决方案次优。为了解决这个问题,本研究引入了一个服务关联成本函数,并开发了一个三目标优化模型,该模型明确考虑了服务质量、成本和服务关联效应。为了有效地求解这个模型,我们提出了一种改进的NSGA-II算法,具有以下关键改进:(1)基于好点集的种群初始化,将好点集与随机采样相结合,以提高解的多样性和搜索效率。(2)基于反向学习的交叉算子,旨在提高探索能力并防止早熟收敛。(3)自适应动态精英策略,动态调整精英保留率并自适应地纳入局部搜索算子,以平衡收敛性和多样性。在基准问题和云服务组合场景上进行的大量实验表明,所提出的算法在收敛性、多样性和鲁棒性方面优于传统的多目标优化方法。这些发现证实了我们方法的有效性及其在实际云制造环境中的实际适用性。