基于膝点的多目标麻雀搜索算法在多云环境下的任务卸载

Guiyi Wei, Anding Wang, Chaijun Chen, Kai Huang
{"title":"基于膝点的多目标麻雀搜索算法在多云环境下的任务卸载","authors":"Guiyi Wei, Anding Wang, Chaijun Chen, Kai Huang","doi":"10.1109/ICSP54964.2022.9778362","DOIUrl":null,"url":null,"abstract":"Computation offloading is a promising technique to improve the quality of service for mobile users in mobile edge computing. However, efficient computation offloading is an NP- hard problem when the mobile user is in a multi-cloudlet scenario. To solve this problem, we construct a multi-objective optimization model which minimizes the delay and cost of all tasks under the constraints of user's requirements. For this purpose, a multi-objective intelligent algorithm, referred as Multi-objective Sparrow Search Algorithm (MSSA) is proposed, which derived from single-objective Sparrow Search Algorithm (SSA). First, we design an adaptive strategy to identify keen points and a ranking rule based on keen points to facilitate the evolution of the population. Second, to address the problem that SSA is prone to fall into local solutions, we design a scaling factor to adjust the population adaptively and propose a formula with better searching capability. Meanwhile, Gaussian mutation is added to explore more precisely in later stage. Then, an elite strategy is introduced to retain high-quality solutions. Finally, experimental results show that our proposed algorithm outperforms NSGA2 and SPEA2 in diversity, convergence and stability. In addition, our algorithm achieves better tradeoff between delay and cost compared to the benchmark experiments.","PeriodicalId":363766,"journal":{"name":"2022 7th International Conference on Intelligent Computing and Signal Processing (ICSP)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Multi-objective Sparrow Search Algorithm Based on Knee Points for Task Offloading in Multi-Cloudlet\",\"authors\":\"Guiyi Wei, Anding Wang, Chaijun Chen, Kai Huang\",\"doi\":\"10.1109/ICSP54964.2022.9778362\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Computation offloading is a promising technique to improve the quality of service for mobile users in mobile edge computing. However, efficient computation offloading is an NP- hard problem when the mobile user is in a multi-cloudlet scenario. To solve this problem, we construct a multi-objective optimization model which minimizes the delay and cost of all tasks under the constraints of user's requirements. For this purpose, a multi-objective intelligent algorithm, referred as Multi-objective Sparrow Search Algorithm (MSSA) is proposed, which derived from single-objective Sparrow Search Algorithm (SSA). First, we design an adaptive strategy to identify keen points and a ranking rule based on keen points to facilitate the evolution of the population. Second, to address the problem that SSA is prone to fall into local solutions, we design a scaling factor to adjust the population adaptively and propose a formula with better searching capability. Meanwhile, Gaussian mutation is added to explore more precisely in later stage. Then, an elite strategy is introduced to retain high-quality solutions. Finally, experimental results show that our proposed algorithm outperforms NSGA2 and SPEA2 in diversity, convergence and stability. In addition, our algorithm achieves better tradeoff between delay and cost compared to the benchmark experiments.\",\"PeriodicalId\":363766,\"journal\":{\"name\":\"2022 7th International Conference on Intelligent Computing and Signal Processing (ICSP)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-04-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 7th International Conference on Intelligent Computing and Signal Processing (ICSP)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICSP54964.2022.9778362\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 7th International Conference on Intelligent Computing and Signal Processing (ICSP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSP54964.2022.9778362","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在移动边缘计算中,计算卸载是一种很有前途的提高移动用户服务质量的技术。然而,当移动用户处于多云环境中时,高效的计算卸载是一个NP难题。为了解决这一问题,我们构建了一个多目标优化模型,在用户需求约束下,使所有任务的延迟和成本最小化。为此,在单目标麻雀搜索算法(SSA)的基础上,提出了一种多目标智能算法——多目标麻雀搜索算法(MSSA)。首先,我们设计了一个自适应策略来识别敏锐点,并设计了一个基于敏锐点的排序规则来促进种群的进化。其次,针对SSA容易陷入局部解的问题,设计了自适应调整人口的比例因子,并提出了搜索能力较好的公式。同时加入高斯突变,在后期进行更精确的探索。然后,引入精英战略来留住高质量的解决方案。实验结果表明,本文提出的算法在多样性、收敛性和稳定性方面都优于NSGA2和SPEA2。此外,与基准实验相比,我们的算法在延迟和成本之间取得了更好的平衡。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Multi-objective Sparrow Search Algorithm Based on Knee Points for Task Offloading in Multi-Cloudlet
Computation offloading is a promising technique to improve the quality of service for mobile users in mobile edge computing. However, efficient computation offloading is an NP- hard problem when the mobile user is in a multi-cloudlet scenario. To solve this problem, we construct a multi-objective optimization model which minimizes the delay and cost of all tasks under the constraints of user's requirements. For this purpose, a multi-objective intelligent algorithm, referred as Multi-objective Sparrow Search Algorithm (MSSA) is proposed, which derived from single-objective Sparrow Search Algorithm (SSA). First, we design an adaptive strategy to identify keen points and a ranking rule based on keen points to facilitate the evolution of the population. Second, to address the problem that SSA is prone to fall into local solutions, we design a scaling factor to adjust the population adaptively and propose a formula with better searching capability. Meanwhile, Gaussian mutation is added to explore more precisely in later stage. Then, an elite strategy is introduced to retain high-quality solutions. Finally, experimental results show that our proposed algorithm outperforms NSGA2 and SPEA2 in diversity, convergence and stability. In addition, our algorithm achieves better tradeoff between delay and cost compared to the benchmark experiments.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术文献互助群
群 号:481959085
Book学术官方微信