摘要
Web服务是一种新型的信息集成架构,将多个Web服务组合成一个能完成复杂任务的组合技术是Web服务中关键技术之一.文中提出了一种基于蚁群算法的服务组合方法,对于服务序列可生成全局最优联盟,同时算法基于蚁群系统的学习能力可以有效减少联盟生成的搜索时间和计算量,可实现性好.
Web services is a new architecture for information integration, web service composition, which is composed of a number of basic services in order to implement a complex task, is the key in web services. This paper presents an approach to service composition based on ant colony algorithm. This method can generate the optimal coalition for the service alignment, and the learning ability of ant colony system can reduce the searching time and computing works effectively.
出处
《武汉理工大学学报（交通科学与工程版）》
2009年第6期1179-1182,共4页
Journal of Wuhan University of Technology（Transportation Science & Engineering）
基金
国家自然科学基金项目(批准号:60375038)资助
关键词
蚁群算法
WEB服务
服务组合
联盟
ant colony algorithm
web services
service composition
coalition
