Open AccessImproved Hunting Search Algorithm for Web Service Composition Optimization
Author(s) -
Q J Wang,
Q L Zhang,
J T Li,
Xin Song,
Z Y Liu
Publication year - 2021
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1994/1/012033
Subject(s) - computer science , web service , quality of service , convergence (economics) , service composition , algorithm , optimization problem , service (business) , optimization algorithm , mathematical optimization , world wide web , mathematics , computer network , economy , economics , economic growth
With the rapid development and application of Web services, the problem of Web service composition optimization based on Quality of Service (QoS) has become a research hotspot in the field of service computing. There are many researches on hunting search algorithm in continuous optimization problems, however, there are few researches using it to solve Web service composition optimization. In this paper, we propose an improvement on the hunting search algorithm (IHuS). It introduces an elite guidance strategy to accelerate the convergence of the algorithm, and at the same time it learns from the mutation strategy in the GA algorithm to improve the diversity of combined services. Compared with the standard HuS and GA algorithms, the experimental results demonstrate that IHuS has faster convergence speed and better optimization performance in solving large-scale Web service composition problems.