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

基于全局QoS和免疫粒子群算法的WEB服务组合研究
引用本文:肖强华,宁丹,廖颖. 基于全局QoS和免疫粒子群算法的WEB服务组合研究[J]. 衡阳工学院学报, 2013, 0(3): 46-50
作者姓名:肖强华  宁丹  廖颖
作者单位:[1]南华大学数理学院,湖南衡阳,421001 [2]南华大学计算机科学与技术学院,湖南衡阳,421001 [3]重庆邮电大学软件学院,重庆,400065
基金项目:湖南省教育厅基金资助项目(11C1099;12C0345)
摘    要:针对现有web服务组合在可靠性和效率方面存在缺陷,提出了一种基于全局QoS和免疫粒子群算法的WEB服务组合优化的策略,给出了构建Web服务及选择最佳服务的方法,有效的克服了传统方法利用穷举计算及遗传算法解决此类问题的局限性,实验结果表明,该方法的服务组合时间短,且服务组合效率高,对解决WEB服务组合这样的NP难题具有非常好的效果。

关 键 词:Web服务组合  服务选取  粒子群算法

Research on Web Services Composition Based on GlobalQoS and Particle Swarm Optimization
XIAO Qiang-hua,NING Dan,LIAO Ying. Research on Web Services Composition Based on GlobalQoS and Particle Swarm Optimization[J]. , 2013, 0(3): 46-50
Authors:XIAO Qiang-hua  NING Dan  LIAO Ying
Affiliation:1. School of Mathematics and Physics, University of South China, Hengyang, Hunan 421001, China; 2. School of Computer Science and Technology, University of South China, Hengyang, Hunan 421001, China; 3. Software College, Chongqing University of Posts and Telecommunications ,Chongqing 400065, China)
Abstract:Based on the defects in the reliability and efficiency in existing web service com-bination,a strategy of Optimization WEB services based on global QoS and immune Particle Swarm algorithm is presented in this paper. Further,we give a best method of building and selecting Web services,which will overcome the limitations of brute-force computation and genetic algorithms in the traditional method effectively. Our experimental results show that the time of combination of service is short,and the efficient combination of service is high-er,which is good to solve the NP problem such as WEB services portfolio.
Keywords:web services combination  services selection  particle swarm optimization
本文献已被 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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