Cluster and reinforcement learning-based multi-objective evolutionary algorithm for joint scheduling of virtual machines and prioritize tasks in cloud computing

IF 8.5 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Aanchal Agrawal, Arun Kumar Pal
{"title":"Cluster and reinforcement learning-based multi-objective evolutionary algorithm for joint scheduling of virtual machines and prioritize tasks in cloud computing","authors":"Aanchal Agrawal,&nbsp;Arun Kumar Pal","doi":"10.1016/j.swevo.2025.102156","DOIUrl":null,"url":null,"abstract":"<div><div>In today’s world, cloud computing is considered an essential on-demand service that is facing an ongoing problem in Virtual Machine (VM) placement and task scheduling optimization that simultaneously improves server efficiency and user experience. Considering these challenges, this paper aims to reduce the makespan, cost, and total tardiness in Joint Scheduling of Virtual Machines and Prioritize Tasks (JSVPT) by a multi-objective optimization framework. We designed a novel Cluster-Based Multi-Objective Evolutionary Algorithm (MOEA-CD/RLPD) framework, which includes a three-tier encoding scheme with Reinforcement Learning (RL)-guided local search, preselection, and dynamic resource allocation strategy to solve the problem. To guide the search process, we employ K-means clustering to decompose the population into diverse subgroups, promoting balanced exploration. The pre-selection mechanism uses a classifier to identify promising solutions in the decision space, which allows resources to be used effectively. Reinforcement learning adaptively selects intensification operators based on reward feedback, improving exploitation by intensifying promising regions of the search space. An Improved Strength Pareto Evolutionary Algorithm 2 (ISPEA2) is incorporated to maintain a diverse and high-quality Pareto archive. The performance of the proposed algorithm is assessed on multiple test instances covering different scales and benchmarked against five state-of-the-art Multi-Objective Evolutionary Algorithms (MOEAs). Experimental studies demonstrate that the proposed algorithm outperforms most existing algorithms in the literature.</div></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":"99 ","pages":"Article 102156"},"PeriodicalIF":8.5000,"publicationDate":"2025-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Swarm and Evolutionary Computation","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S221065022500313X","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

In today’s world, cloud computing is considered an essential on-demand service that is facing an ongoing problem in Virtual Machine (VM) placement and task scheduling optimization that simultaneously improves server efficiency and user experience. Considering these challenges, this paper aims to reduce the makespan, cost, and total tardiness in Joint Scheduling of Virtual Machines and Prioritize Tasks (JSVPT) by a multi-objective optimization framework. We designed a novel Cluster-Based Multi-Objective Evolutionary Algorithm (MOEA-CD/RLPD) framework, which includes a three-tier encoding scheme with Reinforcement Learning (RL)-guided local search, preselection, and dynamic resource allocation strategy to solve the problem. To guide the search process, we employ K-means clustering to decompose the population into diverse subgroups, promoting balanced exploration. The pre-selection mechanism uses a classifier to identify promising solutions in the decision space, which allows resources to be used effectively. Reinforcement learning adaptively selects intensification operators based on reward feedback, improving exploitation by intensifying promising regions of the search space. An Improved Strength Pareto Evolutionary Algorithm 2 (ISPEA2) is incorporated to maintain a diverse and high-quality Pareto archive. The performance of the proposed algorithm is assessed on multiple test instances covering different scales and benchmarked against five state-of-the-art Multi-Objective Evolutionary Algorithms (MOEAs). Experimental studies demonstrate that the proposed algorithm outperforms most existing algorithms in the literature.
云计算中基于聚类和强化学习的虚拟机联合调度和任务优先级多目标进化算法
在当今世界,云计算被认为是一种必要的按需服务,它面临着虚拟机(VM)放置和任务调度优化方面的持续问题,同时提高了服务器效率和用户体验。考虑到这些挑战,本文旨在通过多目标优化框架来降低虚拟机和优先级任务联合调度(JSVPT)的完工时间、成本和总延迟。本文设计了一种新的基于聚类的多目标进化算法(MOEA-CD/RLPD)框架,该框架包括三层编码方案,并结合强化学习(RL)引导的局部搜索、预选和动态资源分配策略来解决该问题。为了指导搜索过程,我们使用K-means聚类将总体分解为不同的子组,促进平衡探索。预选择机制使用分类器来识别决策空间中有希望的解决方案,从而使资源得到有效利用。强化学习基于奖励反馈自适应地选择强化算子,通过强化搜索空间的有希望区域来提高利用率。一个改进的强度帕累托进化算法2 (ISPEA2)被纳入,以保持多样化和高质量的帕累托档案。该算法的性能在覆盖不同尺度的多个测试实例上进行了评估,并与五种最先进的多目标进化算法(moea)进行了基准测试。实验研究表明,该算法优于文献中大多数现有算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Swarm and Evolutionary Computation
Swarm and Evolutionary Computation COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCEC-COMPUTER SCIENCE, THEORY & METHODS
CiteScore
16.00
自引率
12.00%
发文量
169
期刊介绍: Swarm and Evolutionary Computation is a pioneering peer-reviewed journal focused on the latest research and advancements in nature-inspired intelligent computation using swarm and evolutionary algorithms. It covers theoretical, experimental, and practical aspects of these paradigms and their hybrids, promoting interdisciplinary research. The journal prioritizes the publication of high-quality, original articles that push the boundaries of evolutionary computation and swarm intelligence. Additionally, it welcomes survey papers on current topics and novel applications. Topics of interest include but are not limited to: Genetic Algorithms, and Genetic Programming, Evolution Strategies, and Evolutionary Programming, Differential Evolution, Artificial Immune Systems, Particle Swarms, Ant Colony, Bacterial Foraging, Artificial Bees, Fireflies Algorithm, Harmony Search, Artificial Life, Digital Organisms, Estimation of Distribution Algorithms, Stochastic Diffusion Search, Quantum Computing, Nano Computing, Membrane Computing, Human-centric Computing, Hybridization of Algorithms, Memetic Computing, Autonomic Computing, Self-organizing systems, Combinatorial, Discrete, Binary, Constrained, Multi-objective, Multi-modal, Dynamic, and Large-scale Optimization.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信