基于免疫遗传算法的Web服务组合研究  

Research on Immune Genetic Algorithm Based Web Services Composition

作　　者：申艳梅[1] 张亚婷[1] 沈记全[1] 宋俊珂[1] 

机构地区：[1]河南理工大学计算机学院,河南焦作454000

出　　处：《微计算机信息》2009年第36期209-211,共3页Control & Automation

摘　　要：单个Web服务难以满足实际应用的需求,如何组合已有的服务,形成新的服务,已成为此领域的研究热点。本文将每一个可能的Web服务方案表示成一个Web服务组合图,将Web服务问题转化为Web服务组合图优化选取问题,进而提出了一种基于免疫遗传算法的、实现Web服务组合图优化选取的服务组合方法。该方法将Web服务组合图的最长路径作为抗原,每一个Web服务组合图对应一个抗体。实验结果证明了该方法的服务组合时间短,且服务组合效率高。Single Web service just provides limited functionality,and can t meet the needs in practice. How to compose existing services to form new services has become an important research in Web service domain. Each and every possible Web service scheme is expressed as a Web services composition graph,thus converting the Web services problem into a graphically optimal selection problem. Then,to find the optimal solution quickly and accurately,a Web services composition method based on immune genetic algorithm is proposed to implement the optimal selection. This algorithm takes the longest path in the Web services composition graph as an antigen and every Web services composition graph as a corresponding antibody. Experimental results indicate this method not only shortens the needed time of composition, but also increases the efficiency of services composition.

关 键 词：WEB服务组合 Web服务组合图 优化选取 免疫遗传算法 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]