期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
Multi-strategy Enhanced Hiking Optimization Algorithm for Task Scheduling in the Cloud Environment
1
作者 Libang Wu Shaobo Li +2 位作者 Fengbin Wu Rongxiang Xie Panliang Yuan 《Journal of Bionic Engineering》 2025年第3期1506-1534,共29页
Metaheuristic algorithms are pivotal in cloud task scheduling. However, the complexity and uncertainty of the scheduling problem severely limit algorithms. To bypass this circumvent, numerous algorithms have been prop... Metaheuristic algorithms are pivotal in cloud task scheduling. However, the complexity and uncertainty of the scheduling problem severely limit algorithms. To bypass this circumvent, numerous algorithms have been proposed. The Hiking Optimization Algorithm (HOA) have been used in multiple fields. However, HOA suffers from local optimization, slow convergence, and low efficiency of late iteration search when solving cloud task scheduling problems. Thus, this paper proposes an improved HOA called CMOHOA. It collaborates with multi-strategy to improve HOA. Specifically, Chebyshev chaos is introduced to increase population diversity. Then, a hybrid speed update strategy is designed to enhance convergence speed. Meanwhile, an adversarial learning strategy is introduced to enhance the search capability in the late iteration. Different scenarios of scheduling problems are used to test the CMOHOA’s performance. First, CMOHOA was used to solve basic cloud computing task scheduling problems, and the results showed that it reduced the average total cost by 10% or more. Secondly, CMOHOA has been applied to edge fog cloud scheduling problems, and the results show that it reduces the average total scheduling cost by 2% or more. Finally, CMOHOA reduced the average total cost by 7% or more in scheduling problems for information transmission. 展开更多
关键词 Task scheduling Chebyshev chaos Hybrid speed update strategy Metaheuristic algorithms The hiking optimization algorithm(hoa)
在线阅读 下载PDF
考虑煎熬心理成本的应急医疗物资调度的多目标离散徒步优化算法
2
作者 刘勇 黄思文 +1 位作者 马良 武嘉伟 《计算机应用》 北大核心 2026年第3期877-886,共10页
针对突发公共卫生事件中的应急医疗物资调度问题,在最小化运输时间和车辆数的基础上,引入灾民创伤下煎熬心理成本作为优化目标,用于衡量灾民因物资未及时送达所承受的心理压力差异,并提出最小化创伤下煎熬心理成本、运输时间和车辆数的... 针对突发公共卫生事件中的应急医疗物资调度问题,在最小化运输时间和车辆数的基础上,引入灾民创伤下煎熬心理成本作为优化目标,用于衡量灾民因物资未及时送达所承受的心理压力差异,并提出最小化创伤下煎熬心理成本、运输时间和车辆数的多目标应急医疗物资调度模型。针对该模型的NP难(NP-hard)特征,设计一种多目标离散徒步优化算法(MDHOA)。将应急医疗物资调度方案编码为无分隔符的整数序列,再利用Split分割方法解码,设计改进最近邻启发式方法优化初始解,并引入徒步群体驱动的多目标优化机制增强搜索能力。实验结果表明,在Solomon标准测试集上,所提算法在超体积(HV)、总非支配向量数(ONVG)与反世代距离(IGD)这3项指标上总体优于二代非支配排序遗传算法(NSGA-Ⅱ)、改进的二代非支配排序遗传算法(INSGA-Ⅱ)与改进的多目标蜜獾算法(IMOHBA)等对比算法,具有较强的解集覆盖能力与稳定性;在北京市海淀区的实际案例中,所提模型表现出较强的适应性与可行性。灵敏度分析结果表明,灾民心理成本系数与车辆容量对调度策略具有显著影响。 展开更多
关键词 应急医疗物资调度 煎熬心理成本 运输成本 离散徒步优化算法 多目标优化
在线阅读 下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部