An Improved Genetic Algorithm of Web Services Composition with QOS

Abstract

A web service composition method based on the adaptive genetic operator was proposed to deal with the issues of the lack of adaptability and the easy-premature phenomena in web services composition genetic algorithm. Adaptive crossover and mutation operator were designed according to the individual adaptability and evolution stage for enlarging local search range and increasing convergent speed. Moreover, use for reference the idea of taboo table in taboo search algorithm, we can inhibit the algorithm from converging to false optimal solution untimely; meanwhile, an evolution strategy was adopted to prevent the loss of composite service with high fitness value. The experimental result shows that better composite services can be gotten through the improved algorithm; moreover the convergence speed has also been improved.