基于调节熵函数的Web服务组合算法  

Web service composition algorithm based on adjustable entropy function

作　　者：陈彦萍[1] 田改玲[1] 张建科[2] 

机构地区：[1]西安邮电大学计算机学院,陕西西安710121 [2]西安邮电大学理学院,陕西西安710121

出　　处：《西安邮电大学学报》2013年第4期64-70,共7页Journal of Xi’an University of Posts and Telecommunications

基　　金：陕西省自然科学基金资助项目(2012JQ8029);陕西省教育厅科学研究计划基金资助项目(11JK1061)

摘　　要：针对越来越多功能相同服务质量不同的Web服务的出现,为了从相同功能的Web服务中选出满足客户对服务质量需求的服务,并将其在运行时动态组合,提出一种基于调节熵和社会认知算法的Web服务组合算法,即利用调节熵函数将非线性Web服务组合数学模型转化为一个光滑函数的无约束最优化问题,并利用社会认知算法对其进行求解。理论分析表明所提方法可解决Web服务组合最优问题,另外,相对于极大熵方法,新方法能较快逼近目标函数,得到最佳服务组合。There are growing numbers of Web Services which provide the same functionality but differ in quality of Service.There is a need to dynamically combine in the run-time those services that the use’s QoS requirement is satisfied.Therefore,a hybrid algorithm that based on adjustable entropy function and social cognitive optimization Web Service composition algorithm is proposed.The adjustable entropy function is used to transform the nonlinear Web service combination mathematical model into an unconstrained optimization problem for a smooth function.The social cognitive optimization is then used to solve this problem.Experimental results show that the proposed hybrid algorithm can solve Web service composition optimal problem.It can possess approximation and convergence quickly than the maximum entropy method.

关 键 词：WEB服务 服务质量 WEB服务组合 调节熵函数 社会认知算法 

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