Skip to main content

Genetic Programming with Greedy Search for Web Service Composition

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 8056))

Abstract

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.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Andrews, T.: Business Process Execution Language for Web Services (2003)

    Google Scholar 

  2. Aversano, L., di Penta, M., Taneja, K.: A genetic programming approach to support the design of service compositions (2006)

    Google Scholar 

  3. Bang-Jensen, J.: Digraphs: Theory, Algorithms and Applications. Springer (2008)

    Google Scholar 

  4. Bansal, A., Blake, M., Kona, S., Bleul, S., Weise, T., Jaeger, M.: WSC-2008: Continuing the web services challenge. In: IEEE Conf. on E-Commerce Technology, pp. 351–354 (2008)

    Google Scholar 

  5. Carman, M., Serafini, L., Traverso, P.: Web service composition as planning. In: ICAPS Workshop on Planning for Web Services (2003)

    Google Scholar 

  6. Elmaghraoui, H., Zaoui, I., Chiadmi, D., Benhlima, L.: Graph-based e-government web service composition. CoRR, abs/1111.6401 (2011)

    Google Scholar 

  7. Hashemian, S., Mavaddat, F.: A graph-based approach to web services composition. In: Symposium on Applications and the Internet, pp. 183–189 (2005)

    Google Scholar 

  8. Klusch, M., Gerber, A.: Semantic web service composition planning with OWLS-XPlan. In: Int. AAAI Symposium on Agents and the Semantic Web (2005)

    Google Scholar 

  9. Kona, S., et al.: WSC-2009: A quality of service-oriented web services challenge. In: IEEE Int. Conf. on Commerce and Enterprise Computing, pp. 487–490 (2009)

    Google Scholar 

  10. Koza, J.: Genetic Programming. MIT Press (1992)

    Google Scholar 

  11. Kuster, U., Konig-Ries, B., Krug, A.: An online portal to collect and share SWS descriptions. In: IEEE Int. Conf. on Semantic Computing, pp. 480–481 (2008)

    Google Scholar 

  12. Martin, D., et al.: OWL-S Semantic Markup for Web Services (2004)

    Google Scholar 

  13. Oh, S.-C., Lee, D., Kumara, S.: Effective web service composition in diverse and large-scale service networks. IEEE Trans. Services Comp. 1(1), 15–32 (2008)

    Article  Google Scholar 

  14. Oh, S.-C., Lee, D., Kumara, S.R.T.: A comparative illustration of AI planning-based web services composition. SIGecom Exch. 5(5), 1–10 (2006)

    Article  Google Scholar 

  15. Pistore, M., Marconi, A., Bertoli, P., Traverso, P.: Automated composition of web services by planning at the knowledge level. In: IJCAI, pp. 1252–1259 (2005)

    Google Scholar 

  16. Rao, J., Küngas, P., Matskin, M.: Composition of semantic web services using linear logic theorem proving. Inf. Syst. 31(4), 340–360 (2006)

    Article  Google Scholar 

  17. Rodriguez-Mier, P., Mucientes, M., Lama, M., Couto, M.: Composition of web services through genetic programming. Evolutionary Intelligence 3, 171–186 (2010)

    Article  Google Scholar 

  18. Xia, H., Chen, Y., Li, Z., Gao, H., Chen, Y.: Web service selection algorithm based on particle swarm optimization. In: IEEE DASC, pp. 467–472 (2009)

    Google Scholar 

  19. Xiao, L., Chang, C., Yang, H.I., Lu, K.S., Jiang, H.Y.: Automated web service composition using genetic programming. In: IEEE COMPSAC, pp. 7–12 (2012)

    Google Scholar 

  20. Yang, Z., Shang, C., Liu, Q., Zhao, C.: A dynamic web services composition algorithm. J. Comp. Inform. Syst. 6(8), 2617–2622 (2010)

    Google Scholar 

  21. Zhang, W., Chang, C.K., Feng, T., Jiang, H.Y.: QoS-based dynamic web service composition with ant colony optimization. In: IEEE COMPSAC, pp. 493–502 (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wang, A., Ma, H., Zhang, M. (2013). Genetic Programming with Greedy Search for Web Service Composition. In: Decker, H., Lhotská, L., Link, S., Basl, J., Tjoa, A.M. (eds) Database and Expert Systems Applications. DEXA 2013. Lecture Notes in Computer Science, vol 8056. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40173-2_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-40173-2_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-40172-5

  • Online ISBN: 978-3-642-40173-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics