| Abstract:In service computing, service composition problem is one of the key technologies. Large number of candidate services in the atomic case, the classical algorithms are generally looking for the optimal solution, there is large amount of computation, the shortcomings of a long running time, ant colony optimization services portfolio problem is not finding the optimal solution, but the user can identify a feasible solution. In order to more effectively provide various services for users, a static portfolio of services in the building process, to serve a collection of atomic services discovered in the candidate quality of service for weight, the service composition problem into a directed acyclic graph, in combination of the principle of minimum costs, an improved ant colony algorithm for the search method, the number of iterations or a certain quality of service to the user to set the termination conditions for the algorithm to find that combination of candidates for service users need a collection of atoms, then fast and accurate service to the user expectations. |
点此下载全文
次