4.4 Article

Artificial Bee Colony with Cuckoo Search for Solving Service Composition

Journal

INTELLIGENT AUTOMATION AND SOFT COMPUTING
Volume 35, Issue 3, Pages 3385-3402

Publisher

TECH SCIENCE PRESS
DOI: 10.32604/iasc.2023.030651

Keywords

Cloud computing; web service composition; artificial bee colony; cuckoo search

Ask authors/readers for more resources

This paper introduces a hybrid algorithm to solve the service composition problem in cloud computing, which overcomes the limitations of existing algorithms by combining Artificial Bee Colony (ABC) and Cuckoo Search (CS) algorithms, and demonstrates better performance on multiple datasets.
In recent years, cloud computing has provided a Software As A Service (SaaS) platform where the software can be reused and applied to fulfill compli-cated user demands according to specific Quality of Services (QoS) constraints. The user requirements are formulated as a workflow consisting of a set of tasks. However, many services may satisfy the functionality of each task; thus, searching for the composition of the optimal service while maximizing the QoS is formulated as an NP-hard problem. This work will introduce a hybrid Artificial Bee Colony (ABC) with a Cuckoo Search (CS) algorithm to untangle service composition problem. The ABC is a well-known metaheuristic algorithm that can be applied when dealing with different NP-hard problems with an outstanding record of performance. However, the ABC suffers from a slow convergence problem. Therefore, the CS is used to overcome the ABC's limitations by allowing the abandoned bees to enhance their search and override the local optimum. The proposed hybrid algorithm has been tested on 19 datasets and then compared with two standard algorithms (ABC and CS) and three state-of-the-art swarm-based composition algorithms. In addition, extensive parameter study experiments were conducted to set up the proposed algorithm's parameters. The results indicate that the proposed algorithm outperforms the standard algorithms in the three comparison criteria (best fitness value, average fitness value, and average execution time) overall datasets in 30 different runs. Furthermore, the proposed algorithm also exhibits better performance than the state-of-the-art algorithms in the three comparison criteria over 30 different runs.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.4
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available