Application of Chaos Ant Colony Algorithm in Web Service Composition Based on QoS

摘要

In this paper, it introduces a measure which is used in Web service composition based on QoS as well as an advanced chaos algorithm combine optimal chaos and ant colony algorithm. While solving the problem of composite service, help by the random and ergodic of chaos variable, we use chaos variable to make an optimal search, therefore the problem including low efficiency and easily be in a partial optimization that Ant Colony Algorithm brings could be overcome. Otherwise, with the help of Ant Colony Algorithm this called positive feedback decrease the blindness of chaos search and increase the efficiency. After simulating with instances, the results prove this algorithm has a high efficiency and a global optimization.