A novel ant colony optimization algorithm for large scale QoS-based service selection problem

17Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

To tackle the large scale QoS-based service selection problem, a novel efficient clustering guided ant colony service selection algorithm called CASS is proposed in this paper. In this algorithm, a skyline query process is used to filter the candidates related to each service class, and a clustering based shrinking process is used to guide the ant to the search directions. We evaluate our approach experimentally using standard real datasets and synthetically generated datasets and compared it with the recently proposed related service selection algorithms. It reveals very encouraging results in terms of the quality of solution and the processing time required. © 2013 Changsheng Zhang et al.

Cite

CITATION STYLE

APA

Zhang, C., Yin, H., & Zhang, B. (2013). A novel ant colony optimization algorithm for large scale QoS-based service selection problem. Discrete Dynamics in Nature and Society, 2013. https://doi.org/10.1155/2013/815193

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