计算技术与自动化2011，Vol.30Issue(2)：96-99,4.
基于改进蚁群算法的服务组合研究
Service Composition Based on Improved Ant Colony Algorithm
摘要
Abstract
In service computing, service composition problem is one of the key technologies. Large number of candidate services in the atomic case, the classical algorithms are generally looking for the optimal solution, there is large amount of computation, the shortcomings of a long running time, ant colony optimization services portfolio problem is not finding the optimal solution, but the user can identify a feasible solution. In order to more effectively provide various services for users, a static portfolio of services in the building process, to serve a collection of atomic services discovered in the candidate quality of service for weight, the service composition problem into a directed acyclic graph, in combination of the principle of minimum costs, an improved ant colony algorithm for the search method, the number of iterations or a certain quality of service to the user to set the termination conditions for the algorithm to find that combination of candidates for service users need a collection of atoms, then fast and accurate service to the user expectations.关键词
服务计算；服务组合；蚁群算法；服务质量；组合代价Key words
service computing/ service component! Ant colony optimization! Quality of services/ component costs分类
信息技术与安全科学引用本文复制引用
牛永洁,张成..基于改进蚁群算法的服务组合研究[J].计算技术与自动化,2011,30(2):96-99,4.基金项目
陕西省教育厅自然科学项目(11JK1054)；延安市科学技术研究发展计划项目(2009KG-10) （11JK1054）
