A Hybrid Approach for the Multi-constraint Web Service Selection Problem in Web Service Composition

摘要

Web service selection is a critical procedure for building a new composite Web service. To find the best services from the candidate services, both the QoS requirements and the relational constraint rules between services should be considered in the selection. However, most existing researches on Web service selection are focusing on the service's QoS, which may lead to the invalid of the composite service. Hence, we formulate the multi-constraint Web service selection problem in Web service composition, and propose a hybrid approach to solve it. We first construct the fixed tabu list to record infeasible combinations, and then utilize a hybrid particle swarm optimization algorithm to search a solution among the feasible combinations. The experimental results indicate the effectiveness of our approach.