Research on Web Services Composition Based on Particle Swarm Optimization
Zhigang Chen · Jisuanji gongcheng · 2008
This paper presents an improved algorithm based on particle swarm, which is to resolve dynamic Web Services selection with QoSoptimal in Web Services composition. The essence of the algorithm is that the problem of dynamic Web Service selection with QoS optimal istransformed into a multi-objective services composition optimization with QoS constraints. The theory of intelligent optimization of particle swarmoptimization algorithm is utilized to produce a set of optimal Pareto services composition process with constraint principle by accelerating global anddetail searching speed based on deciding PSO state. Experimental results indicate the feasibility and efficiency of this algorithm.