A Multi-Objective Service Selection Algorithm for Service Composition

Service composition is an efficient way to implement a service of complex business process. In service composition, service selection considering multiple QoS objectives is a challenge. Existing methods mainly utilize fitness function or constraint technique to convert multiple objectives service composition problems to single objective ones. These methods take effect with priori knowledge of problem's solution space. Besides, only one solution can be obtained in each execution of one existing method. Users can hardly acquire evenly distributed solutions with acceptable computation cost. In this paper, we propose a lightweight particle swarm optimization service selection algorithm using approximate distance and external archive mechanisms. Simulation results demonstrate that the proposed algorithm is more effective and efficient than the compared algorithm for multi-objective service composition problems.