An enhanced genetic algorithm for web service location-allocation

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

Abstract

Network latency has a significant impact on the response time of web services. Thus, the proper choice of network locations for the deployment of web services is of major importance for the performance of web services. In this paper, we present an enhanced genetic algorithm with self-adaptive feature and memory filter to solve the location-allocation problem for web services. A simulated experiment is conducted using the WS-DREAM dataset with 8 different complexities. The results show that our approach is able to efficiently compute good solutions for the location-allocation problem. © 2014 Springer International Publishing Switzerland.

Cite

CITATION STYLE

APA

Huang, H., Ma, H., & Zhang, M. (2014). An enhanced genetic algorithm for web service location-allocation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8645 LNCS, pp. 223–230). Springer Verlag. https://doi.org/10.1007/978-3-319-10085-2_20

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