Genetic Programming with Greedy Search for Web Service Composition

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

@InProceedings{Wang:2013:DEXA,

• author = "Anqi Wang and Hui Ma and Mengjie Zhang",
• title = "Genetic Programming with Greedy Search for Web Service Composition",
• booktitle = "24th International Conference on Database and Expert, DEXA 2013",
• year = "2013",
• editor = "Hendrik Decker and Lenka Lhotska and Sebastian Link and Josef Basl and A Min Tjoa",
• volume = "8056",
• series = "Lecture Notes in Computer Science",
• pages = "9--17",
• address = "Prague, Czech Republic",
• month = aug # " 26-29",
• organisation = "University of Economics",
• publisher = "Springer",
• keywords = "genetic algorithms, genetic programming",
• isbn13 = "978-3-642-40172-5",
• DOI = "doi:10.1007/978-3-642-40173-2_2",
• size = "9 pages",
• 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 used to generate valid and locally optimised 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 minimisation.",
• notes = "http://www.dexa.org/accepted_papers?cid=301 paper 43. Database and Expert Systems Applications",

}

Genetic Programming entries for Anqi Wang Hui Ma Mengjie Zhang

Citations