Quick convergence of genetic algorithm for QoS-driven web service selection

A novel quickly convergent population diversity handling genetic algorithm (CoDiGA) is presented for web service selection with global Quality-of-Service (QoS) constraints. CoDiGA is characterized by good stability and quick convergence. In CoDiGA, an enhanced initial population policy and an evolution policy are proposed based on population diversity and a relation matrix coding scheme. The integration of the two policies overcomes shortcomings resulting from randomicity of genetic algorithm, such as slow convergence, great variance among the running results, soaring overhead along with increasing size of composition. The simulation results on web service selection with global QoS constraints have shown that prematurity was overcomed effectively, and convergence and stability of genetic algorithm were improved greatly.

[1]  Emile H. L. Aarts,et al.  Global optimization and simulated annealing , 1991, Math. Program..

[2]  Junliang Chen,et al.  Efficient Population Diversity Handling Genetic Algorithm for QoS-Aware Web Services Selection , 2006, International Conference on Computational Science.

[3]  Maria Luisa Villani,et al.  An approach for QoS-aware service composition based on genetic algorithms , 2005, GECCO '05.

[4]  Junliang Chen,et al.  DiGA: Population diversity handling genetic algorithm for QoS-aware web services selection , 2007, Comput. Commun..

[5]  Maria Luisa Villani,et al.  A Lightweight Approach for QoS–Aware Service Composition , 2006 .

[6]  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).

[7]  Bu-Sung Lee,et al.  DAML-QoS ontology for Web services , 2004 .

[8]  Anne H. H. Ngu,et al.  QoS-aware middleware for Web services composition , 2004, IEEE Transactions on Software Engineering.

[9]  Lalit M. Patnaik,et al.  Genetic algorithms: a survey , 1994, Computer.

[10]  Mike P. Papazoglou,et al.  Model Driven Service Composition , 2003, ICSOC.

[11]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[12]  Daniel A. Menascé,et al.  QoS Issues in Web Services , 2002, IEEE Internet Comput..

[13]  Junliang Chen,et al.  A Novel Genetic Algorithm for QoS-Aware Web Services Selection , 2006, DEECS.

[14]  Alberto L. Sangiovanni-Vincentelli,et al.  A theoretical framework for simulated annealing , 1991, Algorithmica.

[15]  Stefan Tai,et al.  The next step in Web services , 2003, CACM.

[16]  Munindar P. Singh,et al.  A DAML-based repository for QoS-aware semantic Web service selection , 2004 .

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

[18]  Daniel A. Menascé,et al.  Composing Web Services: A QoS View , 2004, IEEE Internet Comput..

[19]  Miroslaw Malek,et al.  Current solutions for Web service composition , 2004, IEEE Internet Computing.

[20]  Zbigniew Michalewicz,et al.  Adaptation in evolutionary computation: a survey , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[21]  Tian Chao,et al.  On demand Web services-based business process composition , 2003, SMC'03 Conference Proceedings. 2003 IEEE International Conference on Systems, Man and Cybernetics. Conference Theme - System Security and Assurance (Cat. No.03CH37483).

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

[23]  Héctor Pomares,et al.  Statistical analysis of the main parameters involved in the design of a genetic algorithm , 2002, IEEE Trans. Syst. Man Cybern. Part C.