z-logo
open-access-imgOpen Access
Lightweight approach for multi‐objective web service composition
Author(s) -
Liao Jianxin,
Liu Yang,
Wang Jing,
Wang Jingyu,
Qi Qi
Publication year - 2016
Publication title -
iet software
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.305
H-Index - 43
eISSN - 1751-8814
pISSN - 1751-8806
DOI - 10.1049/iet-sen.2014.0155
Subject(s) - computer science , web service , service (business) , particle swarm optimization , distributed computing , computation , constraint (computer aided design) , a priori and a posteriori , process (computing) , time constraint , selection (genetic algorithm) , mathematical optimization , artificial intelligence , machine learning , algorithm , engineering , world wide web , operating system , mechanical engineering , philosophy , economy , mathematics , epistemology , law , political science , economics
Service composition is an efficient way to implement a service of complex business process in heterogeneous environment. Existing service selection methods mainly utilise fitness function or constraint technique to convert multiple objectives service composition problems to single objective ones. These methods need to take effect with priori knowledge of problem's solution space. Besides, in each execution only one solution can be obtained, hence, users can hardly acquire evenly distributed solutions with acceptable computation cost. The authors also propose a lightweight particle swarm optimisation service selection algorithm for multi‐objective service composition problems. Simulation results illustrate that the proposed algorithm surpasses the comparative algorithm in approximation, coverage and execution time.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here