Genetic Programming with Greedy Search for Web Service Composition

Service compositions build new web services by orchestrating sets of existing web services provided in service repositories. Due to the increasing number of available web services, the search space for finding best service compositions is growing exponentially. In this paper, a combination of genetic programming and random greedy search is proposed for service composition. The greedy algorithm is utilized to generate valid and locally optimized individuals to populate the initial generation for genetic programming, and to perform mutation operations during genetic programming. A full experimental evaluation has been carried out using public benchmark test cases with repositories of up to 15,000 web services and 31,000 properties. The results show good performance in searching for best service compositions, where the number of atomic web services used and the tree depth are used as objectives for minimization.

[1]  Soundar R. T. Kumara,et al.  Effective Web Service Composition in Diverse and Large-Scale Service Networks , 2008, IEEE Transactions on Services Computing.

[2]  Matthias Klusch,et al.  Semantic Web Service Composition Planning with OWLS-Xplan , 2005, AAAI Fall Symposium: Agents and the Semantic Web.

[3]  M. Brian Blake,et al.  WSC-08: Continuing the Web Services Challenge , 2008, 2008 10th IEEE Conference on E-Commerce Technology and the Fifth IEEE Conference on Enterprise Computing, E-Commerce and E-Services.

[4]  Carl K. Chang,et al.  Automated Web Service Composition Using Genetic Programming , 2012, 2012 IEEE 36th Annual Computer Software and Applications Conference Workshops.

[5]  Farhad Mavaddat,et al.  A graph-based approach to Web services composition , 2005, The 2005 Symposium on Applications and the Internet.

[6]  Wei Zhang,et al.  QoS-Based Dynamic Web Service Composition with Ant Colony Optimization , 2010, 2010 IEEE 34th Annual Computer Software and Applications Conference.

[7]  Lerina Aversano,et al.  A genetiv programming approach to support the design of service compositions , 2006, Comput. Syst. Sci. Eng..

[8]  Craig A. Knoblock,et al.  Web service composition as planning , 2003 .

[9]  M. Brian Blake,et al.  WSC-2009: A Quality of Service-Oriented Web Services Challenge , 2009, 2009 IEEE Conference on Commerce and Enterprise Computing.

[10]  Soundar R. T. Kumara,et al.  A comparative illustration of AI planning-based web services composition , 2006, SECO.

[11]  Jerry R. Hobbs,et al.  DAML-S: Semantic Markup for Web Services , 2001, SWWS.

[12]  Matjaz B. Juric,et al.  Business process execution language for web services , 2004 .

[13]  Manuel Mucientes,et al.  Composition of web services through genetic programming , 2010, Evol. Intell..

[14]  Gregory Gutin,et al.  Digraphs - theory, algorithms and applications , 2002 .

[15]  Annapaola Marconi,et al.  Automated Composition of Web Services by Planning at the Knowledge Level , 2005, IJCAI.

[16]  Matthias Klusch,et al.  Evaluation of Service Composition Planning with OWLS-XPlan , 2006, 2006 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology Workshops.

[17]  Birgitta König-Ries,et al.  OPOSSum - An Online Portal to Collect and Share SWS Descriptions , 2008, 2008 IEEE International Conference on Semantic Computing.

[18]  Yan Chen,et al.  Web Service Selection Algorithm Based on Particle Swarm Optimization , 2009, 2009 Eighth IEEE International Conference on Dependable, Autonomic and Secure Computing.

[19]  Mihhail Matskin,et al.  Composition of Semantic Web services using Linear Logic theorem proving , 2006, Inf. Syst..

[20]  Laila Benhlima,et al.  Graph based E-Government web service composition , 2011, ArXiv.