摘要： 为实现大规模Web服务集合的自动组合，提出一种基于后继代价函数的启发式服务组合算法。该算法采用最佳优先原则，根据后继代价函数计算其代价值，通过比较该代价值动态选择并组合Web服务，最终获得全局范围内最优的一组服务集合。实验结果表明，相比简单遍历算法与A*服务组合算法，该算法在大规模服务组合方面性能较优。
关键词:
Web服务,
启发式服务组合,
后继服务,
后继代价函数
Abstract: 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.
Key words:
Web service,
heuristic service composition,
successor service,
Successor Cost Function(SCF)
中图分类号:
鲁健翔, 王如龙, 张锦, 黄德君. 基于后继代价函数的启发式服务组合算法[J]. 计算机工程, 2010, 36(16): 57-59.
LU Jian-Xiang, WANG Ru-Long, ZHANG Jin, HUANG De-Jun. Heuristic Service Composition Algorithm Based on Successor Cost Function[J]. Computer Engineering, 2010, 36(16): 57-59.