文章基本信息

标题：An optimization Algorithm for QoS- Aware Web Service Selection based on Animal Scavenging Behaviour
本地全文：下载
作者：Beena @ Hassina C. ; Sathya M.
期刊名称：International Journal of Advanced Research In Computer Science and Software Engineering
印刷版ISSN：2277-6451
电子版ISSN：2277-128X
出版年度：2013
卷号：3
期号：4
出版社：S.S. Mishra
摘要：Evolutionary algorithms (EA's) are quite popular as they are used for solving real world complex Np-hard problems. In this paper, a new stochastic Animal Scavenging Behaviour (ASB) algorithm based on the foraging behaviour of animals is presented. In ASB the initial population is divided into four categories of individuals namely producer, cluster heads, scroungers and rangers. The proposed scheme provides different forms of searching which are employed by the individuals to modify their search paths. Each Scrounger selects a cluster head as its spearhead and move towards it. Cluster Heads select the global best cluster head as the Producer and adjust their positions based on their information. Thus the proposed ASB algorithm follows these different tactics to mitigate the problem of getting struck at local optima and premature convergence. Web service selection a NP- hard, combinatorial optimization problem is a scheme for choosing appropriate concrete services that fulfils the user's Quality of Service (QoS) parameters from the registry to form the composite service. QoS parameters such as cost, response time, reliability, availability and accuracy of services is vital for optimal web service selection, a significant component of web service composition. Some EA's such as Genetic algorithm (GA), Particle swarm o ptimization (PSO) were used to solve the QoS driven web service selection problem. In this work we have applied ASB to solve the intricate service selection problem. To prove the robustness and efficiency of the performance of ASB, it is tested with benchmark functions both in unimodal and multimodal functions in high and low dimensions. The performance of ASB is also statistically compared with the other competing algorithms namely GA, PSO and GSO. Simulation results illustrates that ASB remarkably outperforms GA, PSO and GSO algorithms. The promising results obtained by ASB shows its capability of solving real world combinatorial problems.
关键词：Web service selection; NP-hard; Combinatorial optimization problem; concrete service; web service ;composition; Group Search optimizer (GSO); Quality of Service (QoS).