Composition of web services through genetic programming

Created by W.Langdon from gp-bibliography.bib Revision:1.4340

  title =        "Composition of web services through genetic
  author =       "Pablo Rodriguez-Mier and Manuel Mucientes and 
                 Manuel Lama and Miguel I. Couto",
  journal =      "Evolutionary Intelligence",
  year =         "2010",
  number =       "3-4",
  volume =       "3",
  pages =        "171--186",
  keywords =     "genetic algorithms, genetic programming, SBSE",
  ISSN =         "1864-5909",
  DOI =          "doi:10.1007/s12065-010-0042-z",
  bibdate =      "2011-02-25",
  bibsource =    "DBLP,
  abstract =     "Web Services are interfaces that describe a collection
                 of operations that are network-accessible through
                 standardized web protocols. When a required operation
                 is not found, several services can be compounded to get
                 a composite service that performs the desired task. To
                 find this composite service a search process in a,
                 generally, huge search space must be performed. The
                 algorithm that composes the services must select the
                 adequate atomic processes and, also, must choose the
                 correct way to combine them using the different
                 available control structures. In this paper a genetic
                 programming algorithm for web services composition is
                 presented. The algorithm has a context-free grammar to
                 generate the valid structures of the composite services
                 and, also, it includes a method to update the
                 attributes of each node. Moreover, the proposal tries
                 to minimize the number of services, and looks for
                 compositions with the minimum execution path. A full
                 experimental validation with four different
                 repositories with up to 1,090 web services has been
                 done, showing a great performance in all the tests as
                 the algorithm finds a valid solution with a short
                 execution path.",
  notes =        "OWL Genetic programming for web services composition.
                 Context free grammar. OWL-S, BPEL4WS. genetic search in
                 contrast to planning. GP tree also carries attribute
                 information. Fitness based on weighted sum of 4 things.
                 t=2 tournament, over lapping generations. Trees pruned
                 and written back (Lamark) to population. Steepest
                 ascent randomised hill climbing. 4 data sets: OWL-S TC
                 V2.2 and three from WSC 2008 WSDL. Java, Linux.

                 p181 'in all tests an acceptable solution has been
                 found [by GP] for all the runs' auto mashup",
  affiliation =  "Department of Electronics and Computer Science,
                 University of Santiago de Compostela, E-15782 Galicia,

Genetic Programming entries for Pablo Rodriguez-Mier Manuel Mucientes Molina Manuel Lama Penin Miguel Ixen Couto Perez