摘要
为提高服务提供商的服务被选率,将优化逆问题应用到Web服务选择领域,提出了Web服务选择优化逆问题,描述了此问题的解决步骤,比较了割平面法和Huang法的优劣,给出了改进方法.为提高Web服务选择优化的求解效率和优度,基于Web服务选择优化逆问题,设计出Web服务选择优化算法——逆选择算法,为服务请求者提供最优或近似最优选择方案.实验结果表明:Web服务选择优化逆问题的解可有效提高服务被选率;逆选择算法可有效提高选择方案的求解效率和优度.
Inverse optimization problem is applied to the field of Web service selection,and the solution to inverse problem can meet the needs of the service provider,increasing the selecting rates of its services.In this paper,inverse optimal selection problem is presented,and the problem-solving procedure is described.Cutting plane algorithm and Huang's method are compared,and the improvements are put forward.The existing Web service selection optimization methods have the drawback of low efficiency or quality.Therefore,an inverse optimization problem-based Web service selection optimization algorithm is presented for the requester to obtain the optimal scheme.Experimental results show that the selecting rates of the services,the quality of selected scheme and the algorithm efficiency have been improved.
出处
《东南大学学报(自然科学版)》
EI
CAS
CSCD
北大核心
2011年第3期437-442,共6页
Journal of Southeast University:Natural Science Edition
基金
国家自然科学基金资助项目(60773105
60473065
60973149
10801031)
国家高技术研究发展计划(863计划)资助项目(2008AA01Z113)
徐州师范大学自然科学基金资助项目(10XLA12)
安徽工业大学青年教师科研资助项目(QZ201015)
关键词
WEB服务
选择优化
整数规划逆问题
逆选择算法
Web services
optimal selection
inverse integer programming problem
inverse-selection algorithm