{'fraction_non_alphanumeric': 0.012443438914027148, 'fraction_numerical': 0.0, 'mean_word_length': 5.9140625, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A Novel Web Service Composition Algorithm for Multiple QoS Constraints

Web services are creating unprecedented opportunities for the formation of online Business-to-Business collaborations. However, effective approach to service composition with multiple QoS constraints still remains an open issue, since both the QoS performance of services and the QoS requirements of applications might dynamically be changed at runtime. In this paper, we introduce a novel service composition algorithm which formulates the service composition problem as a Multiple choice Multiple dimension Knapsack Problem (MMKP) and applies evolution strategy to obtain an approximate solution. Experimental results compare our method with other solutions and demonstrate the effectiveness of our approach toward the identification of an optimal solution to the QoS constrained Web service selection problem.