Applying gravitational search algorithm in the QoS-based Web service selection problem

Bahareh ZIBANEZHAD; Kamran ZAMANIFAR; Razieh Sadat SADJADY; Yousef RASTEGARI

doi:10.1631/jzus.C1000305

Your Location：

Home >

Browse articles >

Applying gravitational search algorithm in the QoS-based Web service selection problem

计算机工程 | Updated：2022-08-31

- Applying gravitational search algorithm in the QoS-based Web service selection problem
- Applying gravitational search algorithm in the QoS-based Web service selection problem
- 信息与电子工程前沿（英文） 2011年12卷第9期页码：730-742
- Affiliations：
  
  1.Computer Engineering Department, Islamic Azad University, Najafabad Branch, Isfahan, Iran
  2.Electrical and Computer Engineering Department, Shahid Behehsti University, Tehran, Iran
- Author bio：
  
  E-mail:b.zibanezhad@gmail.com
  ‡Corresponding Author
- Funds：
- DOI：10.1631/jzus.C1000305
  中图分类号：
- 收稿：2010-09-02，
  
  修回：2011-07-29，
  
  录用：2011-04-02，
  
  纸质出版：2011-09
- Accepted：
Scan QR Code
Applying gravitational search algorithm in the QoS-based Web service selection problem[J]. 信息与电子工程前沿（英文）, 2011,12(9):730-742.

Bahareh ZIBANEZHAD, Kamran ZAMANIFAR, Razieh Sadat SADJADY, et al. Applying gravitational search algorithm in the QoS-based Web service selection problem[J]. Frontiers of Information Technology & Electronic Engineering, 2011, 12(9): 730-742.
Applying gravitational search algorithm in the QoS-based Web service selection problem[J]. 信息与电子工程前沿（英文）, 2011,12(9):730-742. DOI： 10.1631/jzus.C1000305.

Bahareh ZIBANEZHAD, Kamran ZAMANIFAR, Razieh Sadat SADJADY, et al. Applying gravitational search algorithm in the QoS-based Web service selection problem[J]. Frontiers of Information Technology & Electronic Engineering, 2011, 12(9): 730-742. DOI： 10.1631/jzus.C1000305.

摘要

Abstract

With the growing use of service-oriented architecture for designing next generation software systems

the service composition problem and its execution complexity have become even more important in responding to different user requests. The gravitational search algorithm is one of the latest heuristic algorithms. It has a number of distinguishing features

such as rapid convergence

lower memory usage

and the use of particular parameters

for instance

the distance between the solutions. In this paper

we propose a model for the optimization of the Web service composition problem based on qualitative measures and the gravitational search algorithm. To determine the efficacy of this proposed model we solve the problem with the particle swarm optimization algorithm for comparison. Simulation results show that the gravitational search algorithm has a high potential and substantial efficiency in finding the best combination of Web services.

关键词

Keywords

references

浏览量

Downloads

CSCD

文章被引用时，请邮件提醒。

Submit

工具集

关联资源

A self-optimizing QoS-aware service composition approach in a context sensitive environment

Minimal role mining method for Web service composition