A Particle Swarm-based Web Service Dynamic Selection Algorithm with QoS Global Optimal

摘要

How to dynamically composite the existing Web services to a new and value-added complex service to meet the requirement for different users has become a popular research area. A particle swarm-based Web service dynamic selection algorithm is presented to solve the dynamic Web service selection with QoS global optimal in Web service composition. The essence of the algorithm is that convert the problem of QoS global optimal in Web service selection into a multi-objective service with constraints, and particle swarm and chaotic mutation is combined to produce a set of optimal Pareto services composition process with constraints. Experimental results indicate the feasibility and efficiency of this algorithm.