Design and analysis of the artificial bee colony algorithms for domain-oriented QoS-aware service composition Online publication date: Tue, 25-Oct-2016
by Haifang Wang; Xiaofei Xu; Zhongjie Wang; Zhizhong Liu
International Journal of Services Technology and Management (IJSTM), Vol. 22, No. 6, 2016
Abstract: Recently, various evolutionary algorithms have been successfully applied to acquire approximately optimal solutions for QoS-aware service composition problems. Especially, artificial bee colony algorithm (ABC) stands out due to its advantages of few parameters, strong robustness and search capability. In addition, for these algorithms, domain features are widely utilised as heuristic. However, how to combine these two points to achieve more optimal solutions is becoming a challenge. To address this critical challenge, this paper summarises three domain features (priori, similarity and correlation) and proposes the artificial bee colony algorithms for domain-oriented service composition named S-ABCsc paradigm. Besides, the framework of the paradigm is presented, and its seven configurable points are identified. Moreover, two types of algorithms are derived from the paradigm. To apply the paradigm, a support tool is realised, which helps users obtain a concrete algorithm. Furthermore, several comparison experiments are conducted, which have proved the effectiveness of the paradigm.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Services Technology and Management (IJSTM):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com