Hybridizing Artificial Bee Colony with Bat Algorithm for Web Service Composition

作     者：Tariq Ahamed Ahanger Fadl Dahan Usman Tariq 

作者机构：Department of Management Information SystemsCollege of Business AdministrationPrince Sattam Bin Abdulaziz UniversityAl-Kharj11942Saudi Arabia Department of Management Information SystemsCollege of Business Administration-Hawtat Bani TamimPrince Sattam Bin Abdulaziz UniversityAl-Kharj11942Saudi Arabia Department of Computer SciencesFaculty of Computing and Information Technology Al-TurbahTaiz UniversityTaiz9674Yemen 

出 版 物：《Computer Systems Science & Engineering》 (计算机系统科学与工程（英文）)

年 卷 期：2023年第46卷第8期

页      面：2429-2445页

核心收录：

学科分类：0710[理学-生物学] 08[工学] 0836[工学-生物工程] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：The authors extend their appreciation to the Deputyship for Research and Innovation Ministry of Education in Saudi Arabia for funding this research work through the project number 2022/01/22636. 

主　　题：Internet of things artificial bee colony bat algorithm elitist strategy web service composition 

摘      要：In the Internet of Things(IoT),the users have complex needs,and the Web Service Composition(WSC)was introduced to address these needs.The WSC’s main objective is to search for the optimal combination of web services in response to the user needs and the level of Quality of Services(QoS)constraints.The challenge of this problem is the huge number of web services that achieve similar functionality with different levels of QoS constraints.In this paper,we introduce an extension of our previous works on the Artificial Bee Colony(ABC)and Bat Algorithm(BA).A new hybrid algorithm was proposed between the ABC and BA to achieve a better tradeoff between local exploitation and global search.The bat agent is used to improve the solution of exhausted bees after a threshold(limits),and also an Elitist Strategy(ES)is added to BA to increase the convergence rate.The performance and convergence behavior of the proposed hybrid algorithm was tested using extensive comparative experiments with current state-ofthe-art nature-inspired algorithms on 12 benchmark datasets using three evaluation criteria(average fitness values,best fitness values,and execution time)that were measured for 30 different runs.These datasets are created from real-world datasets and artificially to form different scale sizes of WSC datasets.The results show that the proposed algorithm enhances the search performance and convergence rate on finding the near-optimal web services combination compared to competitors.TheWilcoxon signed-rank significant test is usedwhere the proposed algorithm results significantly differ fromother algorithms on 100%of datasets.