Skip to main content
SpringerLink
Log in
Book cover

International Conference on Parallel Processing and Applied Mathematics

PPAM 2013: Parallel Processing and Applied Mathematics pp 392–401Cite as

Evolutionary Algorithms for Abstract Planning

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8384))

Abstract

The paper presents a new approach based on evolutionary algorithms to an abstract planning problem, which is the first stage of the web service composition problem. An abstract plan is defined as an equivalence class of sequences of service types that satisfy a user query. Two sequences are equivalent if they are composed of the same service types, but not necessarily occurring in the same order. The objective of our genetic algorithm (GA) is to return representatives of abstract plans without generating all the equivalent sequences. Experimental results are presented and compared with these obtained using an SMT-solver, showing that GA finds solutions for very large sets of service types in a reasonable and shorter time.

The research described in this paper has been supported by the National Science Centre under the grant No. 2011/01/B/ST6/01477.

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

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 EPUB and 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

Notes

  1. 1.

    If there are more than one such a service type, then one of them is chosen randomly.

  2. 2.

    Selected randomly from \(W_{exp}^q\) at the start of GA.

References

  1. Ambroszkiewicz, S.: Entish: a language for describing data processing in open distributed systems. Fundam. Inform. 60, 41–66 (2004)

    MATH  Google Scholar 

  2. Ching-Seh, W., Khoury, I.: Tree-based search algorithm for web service composition in SaaS. In: 9th International Conference on Information Technology: New Generations (ITNG), pp. 132–138 (2012)

    Google Scholar 

  3. Doliwa, D., Horzelski, W., Jarocki, M., Niewiadomski, A., Penczek, W., Półrola, A., Skaruz, J.: HarmonICS - a tool for composing medical services. In: 4th Central-European Workshop on Services and Their Composition (ZEUS-2012), pp. 25–33 (2012)

    Google Scholar 

  4. Doliwa, D., Horzelski, W., Jarocki, M., Niewiadomski, A., Penczek, W., Półrola, A., Szreter, M., Zbrzezny, A.: PlanICS - a web service composition toolset. Fundam. Inform. 112(1), 47–71 (2011)

    Google Scholar 

  5. Garibay, I., Wu, A.S., Garibay, O.: Emergence of genomic self-similarity in location independent representations. Genet. Program. Evolvable Mach. 7(1), 55–80 (2006)

    Article  Google Scholar 

  6. Kalyanmoy, D.: An efficient constraint handling method for genetic algorithms. Comput. Methods Appl. Mech. Eng. 186, 311–338 (2000)

    Article  MATH  Google Scholar 

  7. Lécué, F.: Optimizing QoS-aware semantic web service composition. In: Bernstein, A., Karger, D.R., Heath, T., Feigenbaum, L., Maynard, D., Motta, E., Thirunarayan, K. (eds.) ISWC 2009. LNCS, vol. 5823, pp. 375–391. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  8. Niewiadomski, A., Penczek, W., Półrola, A.: SMT-based abstract planning in PlanICS ontology. ICS PAS Rep. 127, 1–62 (2012)

    Google Scholar 

  9. Wu, A.S., Lindsay, R.K.: A comparison of the fixed and floating building block representation in the genetic algorithm. Evol. Comput. 4(2), 169–193 (1996)

    Article  Google Scholar 

  10. Rao, J., Su, X.: A survey of automated web service composition methods. In: Cardoso, J., Sheth, A.P. (eds.) SWSWPC 2004. LNCS, vol. 3387, pp. 43–54. Springer, Heidelberg (2005)

    Google Scholar 

  11. Li, Z., O’Brien, L., Keung, J., Xu, X..: Effort-oriented classification matrix of web service composition. In: 5th International Conference on Internet and Web Applications and Services, pp. 357–362 (2010)

    Google Scholar 

  12. Mitra, S., Kumar, R., Basu, S.: Automated choreographer synthesis for web services composition using I/O automata. In: 2007 IEEE International Conference on Web Services (ICWS 2007), pp. 364–371 (2007)

    Google Scholar 

  13. Rao, X., Jinghai, W., Küngas, P., Peep, A., Matskin, W., Mihhail, M.: Composition of semantic web services using linear logic theorem proving. Inf. Syst. 31(4–5), 340–360 (2006)

    Article  Google Scholar 

  14. Gehlot, V., Edupuganti, K.: Use of colored petri nets to model, analyze, and evaluate service composition and orchestration. In: 42nd Hawaii International Conference on System Sciences (HICSS’09), pp. 1–8 (2009)

    Google Scholar 

  15. Traverso, P., Pistore, M.: Automated composition of semantic web services into executable processes. In: McIlraith, S.A., Plexousakis, D., van Harmelen, F. (eds.) ISWC 2004. LNCS, vol. 3298, pp. 380–394. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. ICS, Siedlce University of Natural Sciences and Humanities, 3-Maja 54, 08-110, Siedlce, Poland

    Jaroslaw Skaruz, Artur Niewiadomski & Wojciech Penczek

  2. Institute of Computer Science, Polish Academy of Sciences, Jana Kazimierza 5, 01-248, Warsaw, Poland

    Wojciech Penczek

Authors
  1. Jaroslaw Skaruz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Artur Niewiadomski
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Wojciech Penczek
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jaroslaw Skaruz .

Editor information

Editors and Affiliations

  1. Institute of Computer and Information Science, Czestochowa University of Technology, Czestochowa, Poland

    Roman Wyrzykowski

  2. University of Tennessee, Department of Computer Science, Knoxville, Tennessee, USA

    Jack Dongarra

  3. Institute of Computer and Information Science, Czestochowa University of Technology, Czestochowa, Poland

    Konrad Karczewski

  4. Technical University of Denmark Informatics and Mathematical Modelling, Kongens Lyngby, Denmark

    Jerzy Waśniewski

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Skaruz, J., Niewiadomski, A., Penczek, W. (2014). Evolutionary Algorithms for Abstract Planning. In: Wyrzykowski, R., Dongarra, J., Karczewski, K., Waśniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2013. Lecture Notes in Computer Science(), vol 8384. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-55224-3_37

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-55224-3_37

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-55223-6

  • Online ISBN: 978-3-642-55224-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation