Application of SPEA2 algorithm in Web services selection

Jin-zhong Li, Wenbiao Luo, Zeng Jin-tao, Xia Jie-wu
{"title":"Application of SPEA2 algorithm in Web services selection","authors":"Jin-zhong Li, Wenbiao Luo, Zeng Jin-tao, Xia Jie-wu","doi":"10.1109/YCICT.2010.5713126","DOIUrl":null,"url":null,"abstract":"The problem of Web services selection based on quality of service (QoS) hasn't be essentially solved by the single objective optimal algorithm which optimizes service selection by aggregating multiple QoS parameters to form a composite objective function using weighted scoring method. This paper presents a Web services selection algorithm of QoS-aware and global multi-objective optimization, termed WSSPEA2. The essence of the proposed algorithm is that the problem of Web services selection based on QoS is transformed into a multi-objective services composition optimization problem with QoS constraints. A strength Pareto evolutionary algorithm (SPEA2) is utilized to produce a set of Pareto-optimal solutions by means of simultaneously optimizing a series of objective functions, that is, minimizing service cost(C) and service time(T) with the constaint of satifying the parameters reputation(RE), reliability(R) and availability(A). And the users can select one from these solutions for their preferences. The results of a series of simulation experiments indicate the feasibility and efficiency of this algorithm.","PeriodicalId":179847,"journal":{"name":"2010 IEEE Youth Conference on Information, Computing and Telecommunications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE Youth Conference on Information, Computing and Telecommunications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/YCICT.2010.5713126","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

The problem of Web services selection based on quality of service (QoS) hasn't be essentially solved by the single objective optimal algorithm which optimizes service selection by aggregating multiple QoS parameters to form a composite objective function using weighted scoring method. This paper presents a Web services selection algorithm of QoS-aware and global multi-objective optimization, termed WSSPEA2. The essence of the proposed algorithm is that the problem of Web services selection based on QoS is transformed into a multi-objective services composition optimization problem with QoS constraints. A strength Pareto evolutionary algorithm (SPEA2) is utilized to produce a set of Pareto-optimal solutions by means of simultaneously optimizing a series of objective functions, that is, minimizing service cost(C) and service time(T) with the constaint of satifying the parameters reputation(RE), reliability(R) and availability(A). And the users can select one from these solutions for their preferences. The results of a series of simulation experiments indicate the feasibility and efficiency of this algorithm.
SPEA2算法在Web服务选择中的应用
基于服务质量(QoS)的Web服务选择问题,单目标优化算法并不能从本质上解决。单目标优化算法采用加权计分法,将多个QoS参数聚合成一个复合目标函数来优化服务选择。本文提出了一种具有qos感知和全局多目标优化的Web服务选择算法WSSPEA2。该算法的实质是将基于QoS的Web服务选择问题转化为具有QoS约束的多目标服务组合优化问题。利用强度帕累托进化算法(SPEA2),以满足信誉(RE)、可靠性(R)和可用性(A)为约束条件,同时优化一系列目标函数,即最小化服务成本(C)和服务时间(T),生成一组帕累托最优解。用户可以根据自己的喜好从这些解决方案中选择一个。一系列的仿真实验结果表明了该算法的可行性和有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信