Title :
Improved Algorithm for Dynamic Web Services Composition
Author :
Liu, Liping ; Liu, Anfeng ; Gao, Ya
Author_Institution :
Sch. of Software, Central South Univ., Changsha
Abstract :
This paper presents a model of a web service composing based on particle swarm to resolve dynamic Web services selection with QoS global optimal in Web services composition. It can dynamically select and bind the best suitable Web service to meet the requirement of different users. The essence of the model is that the problem of dynamic Web Service selection with QoS global optimal is transformed into a multi-objective services composition optimization with QoS constraints. The theory of intelligent optimization of multi-objective genetic algorithm is utilized to produce a set of optimal Pareto services composition process with constraint principle by means of optimizing various objective functions simultaneously. Theoretical analysis and experimental results indicate the feasibility and efficiency of this algorithm.
Keywords :
Pareto optimisation; Web services; genetic algorithms; particle swarm optimisation; quality of service; QoS constraints; QoS global optimal; constraint principle; dynamic Web services composition; intelligent optimization; multiobjective genetic algorithm; multiobjective services composition optimization; optimal Pareto services composition process; particle swarm; Algorithm design and analysis; Constraint optimization; Genetic algorithms; Heuristic algorithms; Information science; Pareto optimization; Particle swarm optimization; Quality of service; Software algorithms; Web services; Quality of Services; Services Selection; Web Services Composition; particle swarm optimization;
Conference_Titel :
Young Computer Scientists, 2008. ICYCS 2008. The 9th International Conference for
Conference_Location :
Hunan
Print_ISBN :
978-0-7695-3398-8
Electronic_ISBN :
978-0-7695-3398-8
DOI :
10.1109/ICYCS.2008.60