{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T10:06:49Z","timestamp":1777457209481,"version":"3.51.4"},"reference-count":37,"publisher":"SAGE Publications","issue":"1","license":[{"start":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T00:00:00Z","timestamp":1738368000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Big Data"],"published-print":{"date-parts":[[2025,2,1]]},"abstract":"<jats:p>Cloud resource scheduling is one of the most significant tasks in the field of big data, which is a combinatorial optimization problem in essence. Scheduling strategies based on meta-heuristic algorithms (MAs) are often chosen to deal with this topic. However, MAs are prone to falling into local optima leading to decreasing quality of the allocation scheme. Algorithms with good global search ability are needed to map available cloud resources to the requirements of the task. Honey Badger Algorithm (HBA) is a newly proposed algorithm with strong search ability. In order to further improve scheduling performance, an Improved Honey Badger Algorithm (IHBA), which combines two local search strategies and a new fitness function, is proposed in this article. IHBA is compared with 6 MAs in four scale load tasks. The comparative simulation results obtained reveal that the proposed algorithm performs better than other algorithms involved in the article. IHBA enhances the diversity of algorithm populations, expands the individual\u2019s random search range, and prevents the algorithm from falling into local optima while effectively achieving resource load balancing.<\/jats:p>","DOI":"10.1089\/big.2023.0146","type":"journal-article","created":{"date-parts":[[2025,2,19]],"date-time":"2025-02-19T09:15:07Z","timestamp":1739956507000},"page":"59-72","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":3,"title":["Cloud Resource Scheduling Using Multi-Strategy Fused Honey Badger Algorithm"],"prefix":"10.1177","volume":"13","author":[{"given":"Haitao","family":"Xie","sequence":"first","affiliation":[{"name":"School of Computer Science, Hubei University of Technology, Wuhan, China."}]},{"given":"Chengkai","family":"Li","sequence":"additional","affiliation":[{"name":"School of Science, Hubei University of Technology, Wuhan, China."}]},{"given":"Zhiwei","family":"Ye","sequence":"additional","affiliation":[{"name":"School of Computer Science, Hubei University of Technology, Wuhan, China."}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-8432-8485","authenticated-orcid":false,"given":"Tao","family":"Zhao","sequence":"additional","affiliation":[{"name":"School of Computer Science, Hubei University of Technology, Wuhan, China."}]},{"given":"Hui","family":"Xu","sequence":"additional","affiliation":[{"name":"School of Computer Science, Hubei University of Technology, Wuhan, China."}]},{"given":"Jiangyi","family":"Du","sequence":"additional","affiliation":[{"name":"School of Computer Science, Hubei University of Technology, Wuhan, China."}]},{"given":"Wanfang","family":"Bai","sequence":"additional","affiliation":[{"name":"Xining Big Data Service Administration, Xining, China."}]}],"member":"179","published-online":{"date-parts":[[2025,2,17]]},"reference":[{"issue":"1","key":"e_1_3_3_2_2","first-page":"79","article-title":"Performance evaluation of task scheduling algorithms in virtual cloud environment to minimize makespan","volume":"14","author":"Rajbhupinder K","year":"2022","unstructured":"Rajbhupinder K, , Vijay L, , Balkrishan. Performance evaluation of task scheduling algorithms in virtual cloud environment to minimize makespan. Int J Inf Technol, 2022; 14(1):79\u201393.","journal-title":"Int J Inf Technol"},{"key":"e_1_3_3_3_2","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-023-28707-9"},{"key":"e_1_3_3_4_2","first-page":"1","article-title":"Task scheduling and resource allocation in cloud computing using a heuristic approach","volume":"7","author":"Gawali MB","year":"2018","unstructured":"Gawali MB, , Shinde SK. Task scheduling and resource allocation in cloud computing using a heuristic approach. J Cloud Comput-Adv S, 2018; 7:1\u201316.","journal-title":"J Cloud Comput-Adv S"},{"key":"e_1_3_3_5_2","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2016.2526001"},{"key":"e_1_3_3_6_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10586-023-04090-y"},{"key":"e_1_3_3_7_2","doi-asserted-by":"publisher","DOI":"10.1155\/2021\/5546758"},{"key":"e_1_3_3_8_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2021.06.021"},{"key":"e_1_3_3_9_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2021.03.003"},{"key":"e_1_3_3_10_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11277-021-08806-4"},{"issue":"2","key":"e_1_3_3_11_2","first-page":"2121","article-title":"An efficient enhanced dynamic load balancing weighted round robin algorithm for virtual machine in cloud computing","volume":"13","author":"Syed AS","year":"2022","unstructured":"Syed AS, , Subash CBJ, , Ramesh S, et al. An efficient enhanced dynamic load balancing weighted round robin algorithm for virtual machine in cloud computing. J Algebraic Stat, 2022; 13(2):2121\u20132128.","journal-title":"J Algebraic Stat"},{"key":"e_1_3_3_12_2","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0176321"},{"key":"e_1_3_3_13_2","doi-asserted-by":"publisher","DOI":"10.34028\/iajit\/17\/1\/11"},{"key":"e_1_3_3_14_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10723-019-09499-7"},{"key":"e_1_3_3_15_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.aej.2022.04.006"},{"key":"e_1_3_3_16_2","doi-asserted-by":"publisher","DOI":"10.3233\/JIFS-179299"},{"key":"e_1_3_3_17_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.compeleceng.2022.108234"},{"key":"e_1_3_3_18_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2022.3194195"},{"key":"e_1_3_3_19_2","doi-asserted-by":"crossref","unstructured":"Deepak G Pardeep K. A survey on metaheuristic approaches and its evaluation for load balancing in cloud computing. In: Advanced Informatics for Computing Research Second International Conference Shimla India; 2018; pp. 585\u2013599.","DOI":"10.1007\/978-981-13-3140-4_53"},{"issue":"4","key":"e_1_3_3_20_2","first-page":"527","article-title":"Adaptive load balancing algorithm in web cluster based on improved cuckoo search","volume":"43","author":"Zhang N","year":"2020","unstructured":"Zhang N, , Dong L, , Jin Y, et al. Adaptive load balancing algorithm in web cluster based on improved cuckoo search. J Zhejiang Sci-Tech Univ, 2020; 43(4):527\u2013534.","journal-title":"J Zhejiang Sci-Tech Univ"},{"key":"e_1_3_3_21_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2023.110027"},{"key":"e_1_3_3_22_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2022.01.016"},{"key":"e_1_3_3_23_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107914"},{"issue":"2","key":"e_1_3_3_24_2","first-page":"2461","article-title":"Improvised seagull optimization algorithm for scheduling tasks in heterogeneous cloud environment","volume":"74","author":"Krishnadoss P","year":"2023","unstructured":"Krishnadoss P, , Poornachary VK, , Krishnamoorthy P, et al. Improvised seagull optimization algorithm for scheduling tasks in heterogeneous cloud environment. Cmc-Comput Mater Con, 2023; 74(2):2461\u20132478.","journal-title":"Cmc-Comput Mater Con"},{"key":"e_1_3_3_25_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCC.2017.2693187"},{"key":"e_1_3_3_26_2","first-page":"4903","article-title":"BWFSO: Hybrid Black-widow and Fish swarm optimization Algorithm for resource allocation and task scheduling in cloud computing","volume":"62","author":"Manikandan N","year":"2022","unstructured":"Manikandan N, , Divya P, , Janani S. BWFSO: Hybrid Black-widow and Fish swarm optimization Algorithm for resource allocation and task scheduling in cloud computing. Matertoday:Proceedings, 2022; 62:4903\u20134908.","journal-title":"Matertoday:Proceedings"},{"key":"e_1_3_3_27_2","doi-asserted-by":"publisher","DOI":"10.1049\/ntw2.12001"},{"key":"e_1_3_3_28_2","doi-asserted-by":"publisher","DOI":"10.1109\/JSYST.2019.2960088"},{"key":"e_1_3_3_29_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2018.09.014"},{"key":"e_1_3_3_30_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2022.110032"},{"key":"e_1_3_3_31_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.matcom.2021.08.013"},{"key":"e_1_3_3_32_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.est.2022.106468"},{"key":"e_1_3_3_33_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.enconman.2022.115521"},{"key":"e_1_3_3_34_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2022.108849"},{"key":"e_1_3_3_35_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2022.109339"},{"key":"e_1_3_3_36_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2022.108653"},{"key":"e_1_3_3_37_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.advengsoft.2013.12.007"},{"key":"e_1_3_3_38_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2020.03.055"}],"container-title":["Big Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.1089\/big.2023.0146","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1089\/big.2023.0146","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1089\/big.2023.0146","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T13:03:58Z","timestamp":1777381438000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1089\/big.2023.0146"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,1]]},"references-count":37,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,2,1]]}},"alternative-id":["10.1089\/big.2023.0146"],"URL":"https:\/\/doi.org\/10.1089\/big.2023.0146","relation":{},"ISSN":["2167-6461","2167-647X"],"issn-type":[{"value":"2167-6461","type":"print"},{"value":"2167-647X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,2,1]]}}}