A novel virtual machine placement algorithm based on grey wolf optimization
Virtual machine placement is a typical NP-hard problem in the field of cloud computing. Unreasonable placement schemes can result in low resource utilization and high energy consumption. To address these issues, this paper proposes a heuristic algorithm named Adaptive Boundary Grey Wolf Optimization (ABGWO). The objective is to minimize the number of physical servers, and the evaluation is conducted using Microsoft’s Azure Trace dataset from 2020. Comparative experiments are performed with genetic algorithm, particle swarm optimization algorithm, artificial bee colony algorithm, moth search algorithm, and differential evolution algorithms. The experimental results demonstrate that the ABGWO algorithm outperforms other algorithms in terms of solution quality and stability.
Authors
- Hao Feng (ORCID: https://orcid.org/0000-0003-4418-5847)
- Xiumin Zhou (ORCID: https://orcid.org/0000-0002-5187-6235)
- Haoyu Li (ORCID: https://orcid.org/0000-0002-7138-8263)
- Yuming Liu (ORCID: https://orcid.org/0000-0002-9857-5018)
- Kun Cao (ORCID: https://orcid.org/0000-0003-0669-3058)
Institutions
- Guilin University of Electronic Technology (CN)
Publication Details
- Journal
- Journal of Cloud Computing Advances Systems and Applications
- Published
- 2025-02-13
- DOI
- https://doi.org/10.1186/s13677-025-00730-3
- Citations
- 7
- Primary Topic
- Scheduling and Optimization Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 8.70
Funders
- National Natural Science Foundation of China
- Science and Technology Major Project of Guangxi