An Improved Genetic Algorithm-Based Web Service Composition

2011 ◽  
Vol 225-226 ◽  
pp. 307-310 ◽  
Author(s):  
Long Hao
Keyword(s):  
Genetic Algorithm ◽  
Web Service ◽  
Service Composition ◽  
Web Service Composition ◽  
User Requirements ◽  
Improved Genetic Algorithm ◽  
Input And Output ◽  
Dynamic Service Composition ◽  
Multiple Input ◽  
Composite Services

In this paper a novel web service composition approach based on improved genetic algorithm is proposed. Firstly the relative vector is defined to represented the input and output parameters of user requirements and web services, by comparing the relative vectors, a composed service can be evaluated how much it match user requirements, thus the web service composition is transferred as a linear programming problem. Secondly an improved genetic algorithm is used to search optimum composite services. Compared with the existing approaches, this method supports dynamic service composition, bears component services with multiple input & output parameters, and enables inclusion of parallel and choice structure inside the composite services.

QoS-based Web Service Composition Applying an Improved Genetic Algorithm (IGA) Method

2016 ◽  
Vol 12 (3) ◽  
pp. 60-77 ◽  
Author(s):  
Pooya Shahrokh ◽  
Faramarz Safi-Esfahani
Keyword(s):  
Genetic Algorithm ◽  
Web Services ◽  
Web Service ◽  
Service Composition ◽  
Heuristic Method ◽  
Web Service Composition ◽  
Improved Genetic Algorithm ◽  
Functional Factors ◽  
Research Findings ◽  
The Difference

In recent years, it has been made possible to compose exiting services when a user's request cannot be satisfied by a single web service. Web service composition is faced with several challenges among which is the rapid growth in the number of available web services leading to increased number of web services offering the same functionalities. The difference between similar services is Quality of Service (QoS) consisting of various non-functional factors such as execution time, availability, security, etc. As a result, multiple choices are possible in making a composition plan. Among numerous plans, selecting a composition plan that fulfills customer's requirements has become an important and time-consuming problem. In this paper, the researchers propose a semi-heuristic genetic algorithm that is a combination of both a heuristic method and the genetic algorithm. This heuristic method changes chromosomes based on unsatisfied constraints. Research findings show that the proposed method can be applied to find a composition plan that satisfies user's requirements more efficiently than other methods.

A New Model for Web Service Composition

2011 ◽  
Vol 219-220 ◽  
pp. 638-642
Author(s):  
Long Hao
Keyword(s):  
Web Service ◽  
Service Composition ◽  
Optimization Methods ◽  
Web Service Composition ◽  
New Model ◽  
Model Based ◽  
Multiple Input ◽  
Composite Services ◽  
Individual Service

To support automated Web service composition, it is compelling to provide a template, or model that dictates the ways in which services can be composed. In this paper, a novel composition model based on the relative vector is proposed, where individual services, composite services, and user objectives are described with the relative vectors, through a series of operators defined on the relative vector, available composite services can be found, and how much they meet user objectives can be evaluated. A significant advantage of our approach is that many existing optimization methods can be used to search optimized compositions, where parallel or choice structure is enabled, individual service with multiple input or output parameters is allowed.

Sign in / Sign up

Export Citation Format

Share Document