Cloud resource combinatorial double auction algorithm based on genetic algorithm and simulated annealing

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

Abstract

In this paper, on the basis of the analysis of common market model and some economic theories in the cloud computing resource management process, we propose a cloud resource management model based on combinatorial double auction. In order to solve the winner determination problem (WDP) in the combinatorial double auction, a cloud resource combinatorial double auction algorithm based on genetic algorithm and simulated annealing algorithm is proposed. Simulation results reveal that the algorithm combines genetic algorithm with simulated annealing algorithm (SAGA) outperforms genetic algorithm on fitness value and stability, and as the number of bidders increase, the solution have higher fitness value can be obtained.

Cite

CITATION STYLE

APA

Hu, B., Yao, L., Chen, Y., & Sun, Z. (2017). Cloud resource combinatorial double auction algorithm based on genetic algorithm and simulated annealing. In Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST (Vol. 199, pp. 435–445). Springer Verlag. https://doi.org/10.1007/978-3-319-60717-7_43

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