OPTIMAL WEB SERVICE SELECTION AND COMPOSITION USING MULTI-OBJECTIVE BEES ALGORITHM

被引：17

作者：

Kousalya, G. ^{[1
]}

Palanikkumar, D. ^{[2
]}

Piriyanka, P. R. ^{[2
]}

机构：

[1] SKCET, Dept Comp Sci & Engn, Coimbatore, Tamil Nadu, India

[2] Anna Univ Technol, Dept Comp Sci & Engn, Coimbatore, Tamil Nadu, India

来源：

2011 NINTH IEEE INTERNATIONAL SYMPOSIUM ON PARALLEL AND DISTRIBUTED PROCESSING WITH APPLICATIONS WORKSHOPS (ISPAW) | 2011年

关键词：

D O I：

10.1109/ISPAW.2011.40

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

Web services have received much interest to support business-to-business or enterprise application integration but how to combine these services optimally in a continually growing search space is always a challenge. When there are a large number of Web services available, it is not easy to find an execution path of Web services composition that can satisfy the given request, since the search space for such a composition problem is in general exponentially increasing. In this paper, we design a Multi-objective Bees algorithm to solve this optimal service selection optimization problem. Bees algorithm helps to navigate through the whole search space. Web service data can be queried and a new subspace is built for each loop from which feasible solution can be calculated. Though global optimization cannot be guaranteed, an optimal solution can be obtained as a result.

引用

页码：193 / 196

页数：4