在面向服务的环境下,存在众多可满足服务请求者要求的服务组合方案,如何从中选出最优或近似最优方案是Web服务组合优化要解决的问题.设计出一个不必探索整个解空间的优化算法——SBG算法,为服务请求者提供最优选择方案.实验结果表明,这种方法可有效提高选择方案的求解效率.
In service-oriented environments,there are a number of service composition schemes which can satisfy the needs of service requesters.Web service composition optimization is proposed to solve the problem of selecting the optimal scheme from the schemes.Therefor,the paper presents an optimized algorithm that finds the optimal solution for service requesters without having to explore the entire solution space.Experimental results show that the algorithm efficiency has been improved.