Content area

Abstract

Integrating edge and cloud computing systems builds up a powerhouse, a framework for realizing real-time data processing and conducting large-scale computation tasks. However, efficient resource allocation and task scheduling are outstanding challenges in these dynamic, heterogeneous environments. This paper proposes an innovative hybrid algorithm that amalgamates the features of the Bat Algorithm (BA) and Artificial Bee Colony (ABC) to meet such challenges. The ABC algorithm's solid global search capabilities and the BA's efficient local exploitation are merged for efficient task scheduling and resource allocation. Dynamic adaptation of the proposed hybrid algorithm accommodates such conditions by balancing exploration and exploitation through periodic solution exchanges. Experimental evaluations highlight that the proposed algorithm can minimize execution time and costs involving resource utilization by guaranteeing proper management of task dependencies using a Directed Acyclic Graph (DAG) model. Compared to the available methods, the proposed hybrid technique generates better performance metrics concerning reduced makespan, improved resource utilization, and lower computational delays concerning resource optimization in an edge-cloud context.

Details

1009240
Business indexing term
Title
Hybrid Artificial Bee Colony and Bat Algorithm for Efficient Resource Allocation in Edge-Cloud Systems
Author
Volume
16
Issue
2
Publication year
2025
Publication date
2025
Publisher
Science and Information (SAI) Organization Limited
Place of publication
West Yorkshire
Country of publication
United Kingdom
ISSN
2158107X
e-ISSN
21565570
Source type
Scholarly Journal
Language of publication
English
Document type
Journal Article
ProQuest document ID
3180200349
Document URL
https://www.proquest.com/scholarly-journals/hybrid-artificial-bee-colony-bat-algorithm/docview/3180200349/se-2?accountid=208611
Copyright
© 2025. This work is licensed under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
Last updated
2025-03-26
Database
ProQuest One Academic