A Parameter Adaptive Genetic Algorithm Based Service Compositions

How to select and combine many services with similar functions reasonably and efficiently to provide users with better service is the main challenge in the service composition problem. This is thorny when the number of the candidate Services is huge. Recently, researches transform the service compositions problem as a multi-objective optimizing task, and then the genetic algorithm is commonly used to tackle this issue. However, the fixed crossover probability and mutation probability settings in genetic algorithm usually result to it falls into a local optimal. To improve the performance of the genetic algorithm in the service composition task, this paper proposes an adaptive parameter adjust strategy, which can adjust the crossover probability and mutation probability automatically. The experiment result shows our method has greatly improved the maximum fitness of the final solutions of traditional genetic algorithm.