基于离散微粒群算法的动态Web服务选择  

Dynamic Web Service Selection Based on Discrete Particle Swarm Optimization

作　　者：范小芹[1,2,3] 蒋昌俊[1,2] 方贤文[1,2] 丁志军[1,2] 

机构地区：[1]同济大学电子与信息工程学院,上海201804 [2]同济大学嵌入式系统与服务计算教育部重点实验室,上海201804 [3]山西大学计算机与信息技术学院,太原030006

出　　处：《计算机研究与发展》2010年第1期147-156,共10页Journal of Computer Research and Development

基　　金：国家自然科学基金项目(90818023;90718012;60803032;60803034);国家"八六三"高技术研究发展计划基金项目(2007AA01Z136)

摘　　要：Web服务作为一种新型的Web应用模式近年来得到了迅速的发展.如何高效动态地把现存的各种Web服务整合起来以形成新的满足不同用户需求的增值的复杂服务,已成为新的应用需求和研究热点.针对服务选择问题,设计了一种面向动态Web服务选择的离散微粒群算法,并结合服务选择研究背景,提出了3种速度计算算子和一种位置进化方程.针对进化算法容易陷入局部极值这一共同缺陷,定义了微粒无希望/重希望准则,以保证微粒群的多样性,增强全局搜索能力.理论分析和实验结果表明,该算法不仅具有较快的收敛速度,而且具有较好的全局收敛性能;同时说明Max运算在服务选择中具有较好的综合性能.With the development of Web service theories and technologies,Web service has been spreading rapidly. In order to meet the requirements of different users,multiple services need to be composed. Therefore,how to dynamically and efficiently select appropriate Web services from existing services to build newly value-added and complex services has been a popular research focus. In this paper,a discrete particle swarm optimization （DPSO） algorithm is designed to facilitate the dynamic Web service selection,and combined with the specific meaning of service selection,three kinds of velocity operator and one position evolution equation are proposed. Aimed at the common limitation that evolutionary algorithms are prone to fall into the local optimal solution,no-hope re-hope criterion is introduced to guarantee the diversity of particle swarm and improve the global search ability. Theoretical analysis and experimental results show that the proposed algorithm not only owns a good globally convergent performance but also has a faster convergent rate. Specially,the service selection method is independent of the candidate services number,which means that the efficiency of service selection will not decrease with the increase of available services. Furthermore,compared with other two velocity operators,the Max operator has best comprehensive properties in the process of service selection.

关 键 词：WEB服务 服务选择 服务质量 微粒群算法 离散微粒群算法 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]