By Topic

Independent Global Constraints-aware Web Service Composition Optimization Based on Genetic Algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Xiangwei Liu ; Econ. & Manage. Dept., Anhui Univ. of Sci. & Technol., Huainan ; Zhicai Xu ; Li Yang

At present, the service composition has been a popular research. It is unrealistic to manually analyze and compose the existing services appearing with tremendous growth recently. So, many applications and research about composite services emphasize on semi-automatic mode. In semi-automatic service composition, developers should construct the process model according to concrete application requirement, and then the instance services are bound automatically for every abstract task and make the composite service with optimal performance. The paper presents independent global constrains-aware Web service composition method based on extended color Petri net (eCPN) and genetic algorithm (GA). Firstly, an eCPN modeling methods which can describe multi-attribute multi-constraint relations and associate relation between component services is proposed. Secondly, combining with the properties of eCPN, GA is used to search a legal firing sequence in the eCPN model, and the composite service corresponding to the legal firing sequence. Using legal firing sequences of the Petri net makes the service composition locating space based on GA shrink greatly. Theoretical analysis and experimental results indicate that this method owns both lower computation cost and higher success ratio of service composition.

Published in:

Industrial and Information Systems, 2009. IIS '09. International Conference on

Date of Conference:

24-25 April 2009