Optimal Web service composition method based on an enhanced planning graph and using an immune-inspired algorithm

This paper presents a new approach for the automatic composition of semantic Web services based on the AI planning graph technique. In the context of Web service composition we have extended the planning graph with the new concepts of service cluster and semantic similarity link and have adapted and enhanced an immune-inspired algorithm that ranks the composition solutions according to user preferences. The composition algorithm creates a planning graph in a multi-layered process in order to solve the Web service composition request. Within each layer, semantic similarity links between the input parameters of the selected services in the current layer and the output parameters of other services, selected in previous layers, are stored in a matrix of semantic links. The semantic similarity links are calculated by using evaluation measures adapted from information retrieval such as recall, precision and F-measure.

[1]  Zhang Bin,et al.  Immune algorithm for selecting optimum services in Web services composition , 2008, Wuhan University Journal of Natural Sciences.

[2]  Takahiro Kawamura,et al.  Semantic Matching of Web Services Capabilities , 2002, SEMWEB.

[3]  Vlad Tanasescu,et al.  Toward user oriented semantic geographical information systems , 2006 .

[4]  Stephan Reiff-Marganiec,et al.  Towards Heuristic Web Services Composition Using Immune Algorithm , 2008, 2008 IEEE International Conference on Web Services.

[5]  Yuhong Yan,et al.  An Efficient Syntactic Web Service Composition Algorithm Based on the Planning Graph Model , 2008, 2008 IEEE International Conference on Web Services.

[6]  Fernando José Von Zuben,et al.  Learning and optimization using the clonal selection principle , 2002, IEEE Trans. Evol. Comput..

[7]  Timos K. Sellis,et al.  A Ranking Mechanism for SemanticWeb Service Discovery , 2007, 2007 IEEE Congress on Services (Services 2007).