基于后继代价函数的启发式服务组合算法

Heuristic Service Composition Algorithm Based on Successor Cost Function

为实现大规模Web服务集合的自动组合,提出一种基于后继代价函数的启发式服务组合算法。该算法采用最佳优先原则,根据后继代价函数计算其代价值,通过比较该代价值动态选择并组合Web服务,最终获得全局范围内最优的一组服务集合。实验结果表明,相比简单遍历算法与A*服务组合算法,该算法在大规模服务组合方面性能较优。

To achieve large scale collection of Web service automatic composition,this paper presents a heuristic service composition algorithm based on Successor Cost Function（SCF）.This algorithm adopts best-first principle,calculates the cost value of successor services according to SCF,dynamically chooses and composes Web service by comparing with the cost value,and acquires a best service composition in global scope.Experimental results show that the algorithm has better performance on large scale service composition compared with simple traverse algorithm and A＊ service composition algorithm.