一种高效的服务组合优化算法

Abstract

With the rapid increasing number of the independently developed web services that provide the same functionality but differ in quality of service (QoS), how to select corresponding component services for each task of a specific service composition process in the way that maximizes the aggregation QoS value, while satisfying the constraints set by the end-users is practice known as an NP hard problem. Current solutions are not suitable for most real-time decision-making service composition applications which are required to obtain an optimal result in reasonable time. In this paper, we present an approach which addresses the issue of this problem by constructing convex hulls. The proposed heuristic algorithm consists of two steps: first, convex hulls are constructed for reducing the search space, then the multi-objective optimization problem is solved based on M-HEU. The results of the experiments demonstrate that our approach can obtain a close-to-optimal solution in a reasonable amount of time.