Behnam Mohammad Hasani Zade, Najme Mansouri, Mohammad Masoud Javidi
{"title":"An improved beluga whale optimization using ring topology for solving multi-objective task scheduling in cloud","authors":"Behnam Mohammad Hasani Zade, Najme Mansouri, Mohammad Masoud Javidi","doi":"10.1016/j.cie.2024.110836","DOIUrl":null,"url":null,"abstract":"<div><div>To enhance cloud system performance and customer satisfaction levels, task scheduling must be addressed in the system. Beluga Whale Optimization (BWO) is a metaheuristic method that was developed recently. However, this method still suffers from local minima stagnation despite having an operator that enhances the diversity of population. As a result, Opposition-Based Learning (OBL) can be combined with a Levy Fight Distribution (LFD) and a hybrid balance factor to overcome conventional BWO’s main weaknesses, including slow convergence and local optima traps. We present a multi-objective form of improved BWO (IBWO) to solve task scheduling problems considering both makespan and costs. Multi Objective Improved Beluga Whale Optimization with Ring Topology (MO-IBWO-Ring) is proposed as an efficient task scheduling algorithm that uses whales as feasible solutions for cloud computing tasks. Local search capabilities are also enhanced by using the ring topology concept. The proposed MO-IBWO-Ring algorithm as an optimization algorithm is tested on ten new test functions, and its performance is compared with four algorithms (i.e., Decision space-based Niching Non-dominated Sorting Genetic Algorithm II (DN-NSGAII), Multi-Objective Particle Swarm Optimization algorithm with Ring topology and Special Crowding Distance (MO_Ring_PSO_SCD), Omni-optimizer, and Multi-Objective Particle Swarm Optimization (MOPSO)). Two scenarios have been used to evaluate MO-IBWO-Ring’s performance as a task scheduler. 1) Heterogeneous Computing Scheduling Problem (HCSP) is used as the benchmark dataset with a small (512) and a medium (1024) number of tasks, and 2) with random generated tasks and VMs. When measuring provider metrics, the proposed method achieved better results than competing methods.</div></div>","PeriodicalId":55220,"journal":{"name":"Computers & Industrial Engineering","volume":"200 ","pages":"Article 110836"},"PeriodicalIF":6.7000,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers & Industrial Engineering","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0360835224009586","RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0
Abstract
To enhance cloud system performance and customer satisfaction levels, task scheduling must be addressed in the system. Beluga Whale Optimization (BWO) is a metaheuristic method that was developed recently. However, this method still suffers from local minima stagnation despite having an operator that enhances the diversity of population. As a result, Opposition-Based Learning (OBL) can be combined with a Levy Fight Distribution (LFD) and a hybrid balance factor to overcome conventional BWO’s main weaknesses, including slow convergence and local optima traps. We present a multi-objective form of improved BWO (IBWO) to solve task scheduling problems considering both makespan and costs. Multi Objective Improved Beluga Whale Optimization with Ring Topology (MO-IBWO-Ring) is proposed as an efficient task scheduling algorithm that uses whales as feasible solutions for cloud computing tasks. Local search capabilities are also enhanced by using the ring topology concept. The proposed MO-IBWO-Ring algorithm as an optimization algorithm is tested on ten new test functions, and its performance is compared with four algorithms (i.e., Decision space-based Niching Non-dominated Sorting Genetic Algorithm II (DN-NSGAII), Multi-Objective Particle Swarm Optimization algorithm with Ring topology and Special Crowding Distance (MO_Ring_PSO_SCD), Omni-optimizer, and Multi-Objective Particle Swarm Optimization (MOPSO)). Two scenarios have been used to evaluate MO-IBWO-Ring’s performance as a task scheduler. 1) Heterogeneous Computing Scheduling Problem (HCSP) is used as the benchmark dataset with a small (512) and a medium (1024) number of tasks, and 2) with random generated tasks and VMs. When measuring provider metrics, the proposed method achieved better results than competing methods.
期刊介绍:
Computers & Industrial Engineering (CAIE) is dedicated to researchers, educators, and practitioners in industrial engineering and related fields. Pioneering the integration of computers in research, education, and practice, industrial engineering has evolved to make computers and electronic communication integral to its domain. CAIE publishes original contributions focusing on the development of novel computerized methodologies to address industrial engineering problems. It also highlights the applications of these methodologies to issues within the broader industrial engineering and associated communities. The journal actively encourages submissions that push the boundaries of fundamental theories and concepts in industrial engineering techniques.