蚁群算法在服务选取问题中的分析比较  

Analysis and Comparison of Ant Colony Algorithms for Service Selection

作　　者：张长胜[1] 任明康[1] 尹浩[1] 张斌[1] 

机构地区：[1]东北大学信息科学与工程学院,辽宁沈阳110819

出　　处：《东北大学学报（自然科学版）》2013年第4期500-504,共5页Journal of Northeastern University(Natural Science)

基　　金：国家自然科学基金资助项目(61100090;61073062;61100027);中央高校基本科研业务费专项资金资助项目(N11024006);教育部高等学校博士学科点新教师基金资助项目(20100042120040)

摘　　要：在对蚁群算法进行总结分析的基础上,提出了求解该问题的蚁群优化模型,定义了针对服务选取问题的信息素及启发式信息,并采用6种蚁群算法对该问题进行了求解.最后通过试验对这些算法在服务选取问题中的适用性进行了分析,并与最近提出的服务选取算法进行了比较.结果表明,设计的不同蚁群算法在求解该问题时性能差异较大,其中ACS算法不但收敛速度快,其求解质量也好于被比较的其他算法.An ant colony optimization model for service selection was proposed on the basis of the summation analysis of the existing ant colony algorithms. The phoneme and heuristic information related with service selection were defined, and the six ant colony algorithms were applied to solve it. These algorithms were experimentally analyzed for different aspects and compared with the recently proposed service selection algorithm. The results showed that the performances of these algorithms were different and the ACS algorithm had better performance than the other compared algorithms.

关 键 词：蚁群算法 服务选取 服务质量 群智能 信息素 

分 类 号：TP274[自动化与计算机技术—检测技术与自动化装置]