Service Composition Optimization Based on the Fireworks Algorithm Mixing Hybrid Mutation and Tournament Strategy

Abstract

With web service's standards continuously proposed and the amount of web services increasing, the single-function web service is difficult to solve the problem of complex and changing real-time. In order to acquire the complex services through composing multiple simple Web service, an improved fireworks algorithm that mixing hybrid mutation and tournament strategies are proposed in this paper. Firstly, the hybrid mutation is used to optimize the fireworks mutation process, so as to avoid the algorithm falling into local optimum and improve its global search ability. Then the tournament selection strategy is adopted to pick out the next generation of fireworks population and improve the speed of algorithm convergence. Experimental results verify that the algorithm is effective and stable for Web service composition problems.