蚁群算法在Web服务组合问题中的应用研究  

Application of ant colony algorithm in web services composition problem

作　　者：王创伟[1] 钱雪忠[1] 

机构地区：[1]江南大学 信息工程学院

出　　处：《计算机工程与设计》2007年第24期5912-5914,共3页Computer Engineering and Design

基　　金：网络教育安全强认证技术专项基金项目(教技[2001]750号)

摘　　要：为了满足用户对较为复杂的Web服务请求的需求,就需要把多个原子服务以一定的方式组合起来,而每个原子服务如何选择就成为问题的关键。尝试使用蚁群算法,把组合服务问题转化为从起始点到目标点寻求一条QoS最优的路径问题。给出了组合服务问题的蚁群算法模型以及求解问题算法的伪代码,从而为解决组合服务问题提出了一种新的思路。In order to satisfy the more complex web services request demand to the user, Many element services are combined by some way, but how to choose element service, becomes the key to solve this problem. The ant colony algorithm is used, transforms the problem of composed service for seeks a QoS superior way from the initial point to the target point. A ant colony algorithm model is given to the problem of composed service, and the false code of this algorithm is provided, thereby a new method is presented for the solution the problem of composed service.

关 键 词：WEB服务 原子服务 服务组合 服务质量 蚁群算法 

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