Based Web Service Composition with Genetic Algorithm and Ant Colony Optimization
DOI:
CSTR:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    To improve the convergence ability of service selection technology in process of Web service composition, the paper presents a multi-objective optimization strategy based on genetic algorithm and ant colony algorithm to solve global optimization problem in QoS-based Web service composition. In the paper, global optimization problem in Web service composition is presented as a QoS optimal routing problem. And then, an improved genetic algorithm is proposed to get pheromone distribution in initial route of ant colony algorithm. At last, an improved ant colony algorithm is presented to get the optimal solution. Simulation result suggests that the improved algorithms can get the optimal routing in less evolutional generation than typical algorithms, and improve global research ability in Web Service composition.

    Reference
    Related
    Cited by
Get Citation

曹腾飞,符云清,钟明洋.融合遗传蚁群算法的Web 服务组合研究.计算机系统应用,2012,21(6):81-85

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:September 28,2011
  • Revised:October 21,2011
  • Adopted:
  • Online:
  • Published:
Article QR Code
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-3
Address:4# South Fourth Street, Zhongguancun,Haidian, Beijing,Postal Code:100190
Phone:010-62661041 Fax: Email:csa (a) iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063