基于树型二重结构编码遗传算法的服务选择  

Web service selection based on genetic algorithm with tree dual-structure code

作　　者：李淑芝[1] 杨书新[1] 王继升[1] 

机构地区：[1]江西理工大学信息工程学院,江西赣州341000

出　　处：《计算机应用》2008年第12期3017-3020,共4页journal of Computer Applications

基　　金：江西省教育厅资助项目(赣教技字[2007]208号)

摘　　要：提出了Web服务语法业务流程树的概念,并结合基于QoS的Web服务全局选择的特点,研究了一种用于组合服务QoS优化的基于树型二重结构编码的遗传算法GATD。该方法建立在服务语法业务流程树先序遍历序列编码的基础上,采用二重编码方法处理用户的QoS约束条件,不仅能够有效地选择出满足用户QoS需求的服务资源,而且可以较好地支持服务运行时快速再规划。A concept of syntactic business process tree for Web service was proposed, And considering the characteristics of service global selection based on QoS, a genetic algorithm with tree dual-structure code for Web service global selection named GATD was studied. This algorithm was established on syntactic business process tree for Web service （SBPT4WS） and dealt with restriction conditions with dual-structure code. And it can not only effectively select service resource meeting users＇ QoS requirements, but also preferably support rapid replanning on service executione.

关 键 词：WEB服务 服务质量 Web服务语法业务流程树 树型二重结构编码 遗传算法 

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