scholarly journals Optimized Artificial Bee Colony Algorithm for Web Service Composition Problem

2021 ◽  
Vol 11 (5) ◽  
pp. 327-332
Author(s):  
Shudong Zhang ◽  
◽  
Yaru Shao ◽  
Lijuan Zhou
Keyword(s):  
Web Service ◽  
Service Composition ◽  
Artificial Bee Colony Algorithm ◽  
Artificial Bee Colony ◽  
Web Service Composition ◽  
Bee Colony ◽  
Composition Problem

Applying Evolutionary Many-Objective Optimization Algorithms to the Quality-Driven Web Service Composition Problem

2016 ◽  
pp. 170-194
Author(s):  
Arion de Campos Jr. ◽  
Aurora T. R. Pozo ◽  
Silvia R. Vergilio
Keyword(s):  
Web Services ◽  
Web Service ◽  
Service Composition ◽  
Optimization Algorithms ◽  
Web Service Composition ◽  
Nsga Ii ◽  
Preference Relations ◽  
Multi Objective ◽  
Composition Problem

The Web service composition refers to the aggregation of Web services to meet customers' needs in the construction of complex applications. The selection among a large number of Web services that provide the desired functionalities for the composition is generally driven by QoS (Quality of Service) attributes, and formulated as a constrained multi-objective optimization problem. However, many equally important QoS attributes exist and in this situation the performance of the multi-objective algorithms can be degraded. To deal properly with this problem we investigate in this chapter a solution based in many-objective optimization algorithms. We conduct an empirical analysis to measure the performance of the proposed solution with the following preference relations: Controlling the Dominance Area of Solutions, Maximum Ranking and Average Ranking. These preference relations are implemented with NSGA-II using five objectives. A set of performance measures is used to investigate how these techniques affect convergence and diversity of the search in the WSC context.

Sign in / Sign up

Export Citation Format

Share Document