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

Computer Engineering | 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
- Frontiers of Information Technology & Electronic Engineering Vol. 12, Issue 9, Pages: 730-742(2011)
- 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
  CLC：
- Received：02 September 2010，
  
  Revised：2011-07-29，
  
  Accepted：02 April 2011，
  
  Published：2011-09
- Accepted：
Scan QR Code
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：

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

Views

Downloads

CSCD

Alert me when the article has been cited

Submit

Tools

Publicity Resources

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

Minimal role mining method for Web service composition

Related Author

Yuan-hong SHEN

Xiao-hu YANG

Chao HUANG

Jian-ling SUN

Xin-yu WANG

Yuan-jie SI

Related Institution

School of Computer Science and Technology, Zhejiang University

Department of Computer Science and Technology, Zhejiang University

Chat

Address：Zhejiang University Press, 148 Tianmushan Road, Hangzhou, China Postal code：310028
Tel：+86-571-88273162 Email：fitee@zju.edu.cn
It is recommended to read the content of this site in Chrome&IE9+. Please switch to extreme mode in browser 360.
Cookies We use cookies to help provide and enhance our service and tailor content. By continuing, you agree to the use of cookies.

⁰