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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
If there are more than one such a service type, then one of them is chosen randomly.
- 2.
Selected randomly from \(W_{exp}^q\) at the start of GA.
References
Ambroszkiewicz, S.: Entish: a language for describing data processing in open distributed systems. Fundam. Inform. 60, 41–66 (2004)
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)
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)
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)
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)
Kalyanmoy, D.: An efficient constraint handling method for genetic algorithms. Comput. Methods Appl. Mech. Eng. 186, 311–338 (2000)
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)
Niewiadomski, A., Penczek, W., Półrola, A.: SMT-based abstract planning in PlanICS ontology. ICS PAS Rep. 127, 1–62 (2012)
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)
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)
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)
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)
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)
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)
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)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights 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)