基于局部选择和遗传算法的QoS感知的服务组合方法  

Qo S-aware Web Service Composition Based on Local Selection and Genetic Algorithm

作　　者：叶恒舟[1,2] 关云慧 

机构地区：[1]桂林理工大学信息科学与工程学院,广西桂林541000 [2]广西大学电气工程学院,南宁530004

出　　处：《小型微型计算机系统》2016年第7期1389-1392,共4页Journal of Chinese Computer Systems

基　　金：广西自然科学基金项目(2014GXNSFBA118269)资助;国家自然科学基金项目(51365010)资助

摘　　要：随着Web服务组合领域的不断发展,出现了大量功能相同或相似,但非功能性属性不同的服务.在选择服务时,如何满足广大用户对服务质量(Qo S)的需求是一个具有挑战性的课题.针对服务组合优化这一难题,提出了一种基于局部选择和遗传算法的Qo S感知的服务组合方法.该方法的主要思想是当为一个服务寻找最优组合时,为了提高求解效率,可以先为每个抽象服务优选出若干候选服务,使解空间规模大大缩小,再通过遗传算法对这种非线性规划问题进行求解.实验结果表明该方法具有较好的执行效率和适应度.With the continuous development of web service composition domain,a large number of services with the same or similar functions are emerging,while they own different non-functional properties. It is a challenging task to satisfy the vast users＇ requirements about the Qo S（ quality of service） when we select candidate services for a composition service. In order to solve the difficult problem of service composition optimization,this paper proposes a Qo S-aware service composition approach which is based on local selection and genetic algorithm. The main idea is when people are looking for the optimal composition for a service,in order to improve the efficiency of solving the problem,we can optimize several candidate services for each abstract service at first so that the scale of solution space will be greatly reduced,then use the genetic algorithm to solve the nonlinear programming problems. The experimental result indicates that this method has a very good executive efficiency and fitness.

关 键 词：服务组合优化 服务选择 QOS感知 遗传算法 

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