Web Service Selection Algorithm Based on Particle Swarm Optimization

A novel multi-objective optimization based particle swarm optimization algorithm is presented to solve the global optimization problem for based services selecting in Web services composition technology. This algorithm takes Web services selection as a multi-objective constrained optimization problem with constraints. It introduces multi-objective PSO intelligent theory to optimize multi parameters simultaneously, and produces a set of constraints to meet the Pareto optimal solution. The experiments show that the algorithm is a feasible and efficient method for Web services selection.

[1]  B. Pagurek,et al.  Service offerings for xml web services and their management applications , 2004 .

[2]  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.

[3]  Vladimir Tosic,et al.  Web Service Offerings Infrastructure (WSOI) - a management infrastructure for XML Web services , 2004, 2004 IEEE/IFIP Network Operations and Management Symposium (IEEE Cat. No.04CH37507).

[4]  Anne H. H. Ngu,et al.  QoS computation and policing in dynamic web service selection , 2004, WWW Alt. '04.

[5]  Wang Jia-yao.  A Modified Particle Swarm Optimization for Solving Constrained Optimization Problems in Geospatial Services Selection , 2007 .

[6]  Gao Chun-min.  Application of tree-coding genetic algorithm on Web services selection. , 2007 .

[7]  Yue Kun,et al.  Underlying Techniques for Web Services: A Survey , 2004 .

[8]  Quan Z. Sheng,et al.  Quality driven web services composition , 2003, WWW '03.

[9]  Zhao Jun.  A Web Services Composition Method Supporting Domain Feature , 2005 .

[10]  H. Brachinger,et al.  Decision analysis , 1997 .

[11]  Vladimir Tosic,et al.  WSOL - Web Service Offerings Language , 2002, WES.

[12]  Cui Xun.  A Constrained Quality of Service Routing Algorithm with Multiple Objectives , 2004 .

[13]  Zafar U. Singhera.  Extended Web Services Framework to Meet Non-Functional Requirements , 2004, SAINT Workshops.

[14]  Liao Yuan.  A Method of QoS-Aware Service Components Composition , 2005 .

[15]  Tao Yu,et al.  Service Selection Algorithms for Web Services with End-to-End QoS Constraints , 2004, CEC.

[16]  Chen Yan.  A Method Satisfying Markov Process of Web Service Composition under Incomplete Constrains , 2006 .

[17]  Imtiaz Ahmad,et al.  Particle swarm optimization for task assignment problem , 2002, Microprocess. Microsystems.

[18]  Xiaodong Li,et al.  Comparing particle swarms for tracking extrema in dynamic environments , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

[19]  Hartmut Ritter,et al.  Efficient Selection and Monitoring of QoS-Aware Web Services with the WS-QoS Framework , 2004, IEEE/WIC/ACM International Conference on Web Intelligence (WI'04).

[20]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .