Computer Engineering and Applications ›› 2011, Vol. 47 ›› Issue (14): 83-86.

• 网络、通信、安全 • Previous Articles     Next Articles

Research on Web services selection based on SPEA2+ algorithm

LI Jinzhong,ZENG Jintao,XIA Jiewu,LUO Wenlang   

  1. School of Electronic and Information Engineering,Jinggangshan University,Ji’an,Jiangxi 343009,China
  • Received:1900-01-01 Revised:1900-01-01 Online:2011-05-11 Published:2011-05-11

基于SPEA2+算法的Web服务选择研究

李金忠,曾劲涛,夏洁武,罗文浪   

  1. 井冈山大学 电子与信息工程学院,江西 吉安 343009

Abstract: The algorithm of services selection is a key factor which can affect the QoS of composite service and the performance of service composition.The problem of Web service selection based on QoS hasn’t been essentially solved by a class of selection algorithms that aggregate multiple QoS parameters to form a composite objective function for optimization using weighted scoring method.In this paper,a Web service selection approach based on an improved strength Pareto evolutionary algorithm(SPEA2+) is designed to solve this problem by multiobjecitve optimization.The Pareto-optimal solutions are obtained by simultaneously minimizing service time(T) and service cost(C) with satisfying the constraints of the parameters reputation(RE),reliability(R) and availability(A).Some experiments are made to compare SPEA2+ with SPEA2 for solving this problem and the results show both SPEA2+ and SPEA2 have their advantages and disadvantages in some cases,and users can select solutions according to their preferences for T or C.

Key words: Quality of Service(QoS), Web Service, services selection, SPEA2+

摘要: 服务选择算法是影响组合服务的QoS和服务组合性能高低的关键因素。针对将多维QoS属性加权聚合为一个目标函数进行优化的选择算法不能实质性地解决基于QoS的Web服务选择问题,采用改进的强度Pareto进化算法(SPEA2+)多目标优化求解该问题,设计了一种Web服务选择算法。该算法在满足声誉、可靠性和可利用性属性的约束下,同时最小化服务时间T和服务费用C,以产生Pareto最优解集。通过与运用SPEA2算法求解该问题的实验对比,表明了两算法所获取的Pareto最优解集中QoS属性T和C各均值各有优劣,用户可依据对T或C的偏好择优选择。

关键词: 服务质量, Web服务, 服务选择, SPEA2+