一种费用最廉的Web服务动态组合算法

Dynamic Web Service Composition Algorithm with Optimal Cost

针对现有组合服务选取的算法因其复杂度太高而难以在实际环境中应用,提出了一种Web服务动态组合优化算法。该算法利用最优化原则在服务组合图中求解一组执行费用最廉、满足用户需求的Web服务。

A dynamic Web service selection algorithm with optimal cost is proposed to resolve the problem that many selection algorithms for services composition are difficult to be implemented in the realistic environment because of their high complexity. The theory of optimization principle is utilized in this algorithm to produce a set of Web services with optimal cost and meeting the requirement of QoS in the Web service composition graph.