| With the development of the Internet, the applications are gradually entering the age of networking. how to build interaction on different platforms is a fundamental problem. Therefore, the need to formulate mechanisms and standards which can communicate with each other for an application is urgent. Web Service emerged. Web Service was a great success because of its good interoperability, repeatability, high flexibility and low cost. Considering that a single, repetitive Web Service cannot meet the current web environment, combining existing Web Service into a new added value of Web Service is a hot research topic in recent years.The traditional genetic algorithm has been applied to Web Service Composition by many scholars. However, with the growth of data and the amount of information, convergence rate became more and more slow and resulted in local convergence. In this paper, we propose a genetic algorithm model which is combined with Rough Sets aim at Web Service. The new model improved the existing genetic algorithm. First of all, through the use of functional requirements solutions to encode the chromosome, initial population was established, so that the selection to Web Service can be more straightforward. Then, with the reduction rules of Rough Set to narrow the scope of the initial population of the domain, traditional genetic algorithm was improving the performance. At the same time, the reduct rules are validate the feasibility of composition when the crossover and mutation of genetic algorithm are processed. Thus, the convergence is improved. Finally, through constant iteration users can obtain the optimal solution of Web Service composition.Firstly, this article introduces the relevant technology of Web Service and Rough Sets theory. Then we described the proposed algorithm in detail. Finally, the simulation results indicate the feasibility of the algorithm by comparing our algorithm in this paper with genetic algorithm. |
PDF Full Text Request