Qos-based web services composition optimization with an extended bat inspired algorithm

7Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The QoS-Based Web services composition optimisation problem is an NP-Hard problem. So far, solving such a problem consists on finding its optimal solution, while optimizing an objective function using the QoS as an optimization criteria. In this paper, we propose an approach based on the use of a new Extended Bat Inspired Algorithm to deal with the QoS-Based Web Services composition optimization problem. The Bat Inspired Algorithm has the advantage of providing a very quick convergence at a very early stage by switching from exploration to exploitation. This makes it an efficient algorithm. The originality of the proposed approach is the designing and the built of the composition solutions by adjusting the main parameters of the algorithm. Then, to compare potential generated solutions, different QoS attributes are considered and aggregated at the complete composition level. A prototype has been realized and applied to a text translation case study. The results of experimentation are very encouraging and show that the approach is highly efficient in terms of optimality rate and running time.

Cite

CITATION STYLE

APA

Boussalia, S. R., Chaoui, A., & Hurault, A. (2015). Qos-based web services composition optimization with an extended bat inspired algorithm. In Communications in Computer and Information Science (Vol. 538, pp. 306–319). Springer Verlag. https://doi.org/10.1007/978-3-319-24770-0_27

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free