An Improved Genetic Algorithm-Based Web Service Composition

Abstract:

Article Preview

In this paper a novel web service composition approach based on improved genetic algorithm is proposed. Firstly the relative vector is defined to represented the input and output parameters of user requirements and web services, by comparing the relative vectors, a composed service can be evaluated how much it match user requirements, thus the web service composition is transferred as a linear programming problem. Secondly an improved genetic algorithm is used to search optimum composite services. Compared with the existing approaches, this method supports dynamic service composition, bears component services with multiple input & output parameters, and enables inclusion of parallel and choice structure inside the composite services.

Info:

Periodical:

Advanced Materials Research (Volumes 225-226)

Edited by:

Helen Zhang, Gang Shen and David Jin

Pages:

307-310

DOI:

10.4028/www.scientific.net/AMR.225-226.307

Citation:

L. Hao "An Improved Genetic Algorithm-Based Web Service Composition", Advanced Materials Research, Vols. 225-226, pp. 307-310, 2011

Online since:

April 2011

Authors:

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.