首页 | 本学科首页   官方微博 | 高级检索  
     

QoS全局最优的多目标Web服务选择算法*
引用本文:方其庆,刘庆华,彭晓明,胡亚慧.QoS全局最优的多目标Web服务选择算法*[J].计算机应用研究,2009,26(12):4442-4445.
作者姓名:方其庆  刘庆华  彭晓明  胡亚慧
作者单位:1. 通信指挥学院,武汉,430010;空军雷达学院,武汉,430019
2. 空军雷达学院,武汉,430019
3. 武汉大学,计算机学院,武汉,430072
基金项目:国家“863”计划资助项目(2007AA01Z138)
摘    要:针对现有方法的不足,提出一种基于QoS全局最优的多目标动态Web服务选择算法。在给出动态服务组合模型的基础上,以“抽象服务规划”为输入,以用户的非功能性需求为全局约束,将动态服务选择问题转换为一个带QoS约束的多目标服务组合优化问题;利用多目标蚁群算法,多个目标函数被同时优化并产生一组满足约束条件的Pareto优化解。通过运用实验与基于多目标遗传算法的Web服务选择算法进行对比,证明了该方法的可行性和有效性。

关 键 词:Web服务    服务选择    全局优化    多目标蚁群算法

Global QoS optimizing and multi-objective Web service selection algorithm
FANG Qi-qing,LIU Qing-hu,PENG Xiao-ming,HU Ya-hui.Global QoS optimizing and multi-objective Web service selection algorithm[J].Application Research of Computers,2009,26(12):4442-4445.
Authors:FANG Qi-qing  LIU Qing-hu  PENG Xiao-ming  HU Ya-hui
Affiliation:(1.Commanding Communications Academy, Wuhan 430010, China; 2. Air Force Radar Academy, Wuhan 430019, China ; School of Computer, Wuhan University, Wuhan 430072, China)
Abstract:To resolve the deficiency of the existing approaches, this paper presented a novel global QoS optimizing dynamic Web service selection algorithm. Firstly, proposed a model of Web service composition. Consequently,with the "abstract ser-vice plan" as input and the user non-functional requirements as global constraints, converted the Web service selection problem into a multi-objective optimization problem. Furthermore, based on the multi-objective ant colony algorithm(MOACO), the proposed algorithm simultaneously optimized the different QoS parameters of the workflow. In this way, calculated a set of optimal solutions, known as Pareto set. Experimental results prove the proposed algorithm outperforms the recently published QoS global optimization based on multi-objective genetic algorithm (MOGA), specially designed for solving the Web services selection problem.
Keywords:Web service  Web service selection  global optimization  MOACO
本文献已被 万方数据 等数据库收录!
点击此处可从《计算机应用研究》浏览原始摘要信息
点击此处可从《计算机应用研究》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号