Web services composition has been one of the hottest research topics. But with the ever increasing number of functional similar web services being made available on the Internet, there is a need to be able to distinguish them using a set of well-defined Quality of Service (QoS) criteria. The cost is the primary concern of many business processes. In this paper, we propose a new solution using Genetic Algorithm (GA) in cost-driven web service selection. GA is utilized to optimize business process composed of many service agents (SAg). Each SAg corresponds to a collection of available web services provided by multiple service providers to perform a specific function. Service selection is an optimization process with taking into account the relationships among the services. Better performance has been gotten using GA in the paper than using local service selection strategy. The global optimal solution might also be achieved with proper GA parameters.
[1]
Anne H. H. Ngu,et al.
QoS computation and policing in dynamic web service selection
,
2004,
WWW Alt. '04.
[2]
Liang-Jie Zhang,et al.
Requirements Driven Dynamic Services Composition for Web Services and Grid Solutions
,
2004,
Journal of Grid Computing.
[3]
Anne H. H. Ngu,et al.
Declarative composition and peer-to-peer provisioning of dynamic Web services
,
2002,
Proceedings 18th International Conference on Data Engineering.
[4]
Peter Norvig,et al.
Artificial Intelligence: A Modern Approach
,
1995
.
[5]
Arthur H. M. ter Hofstede,et al.
What's in a Service?
,
2002,
Distributed and Parallel Databases.
[6]
Sanjiva Weerawarana,et al.
Unraveling the Web services web: an introduction to SOAP, WSDL, and UDDI
,
2002,
IEEE Internet Computing.