The Study of Improved Ant Colony Algorithm for Routing Problem of Service Composition

2010 International Conference on E-Product E-Service and E-Entertainment Pub Date : 2010-12-10 DOI:10.1109/ICEEE.2010.5660998
Shuhang Guo, Yating Zhang, Mo Hai
{"title":"The Study of Improved Ant Colony Algorithm for Routing Problem of Service Composition","authors":"Shuhang Guo, Yating Zhang, Mo Hai","doi":"10.1109/ICEEE.2010.5660998","DOIUrl":null,"url":null,"abstract":"To improve the adaptability and stability of Dijkstra algorithm for solving routing problem of service composition, a method to solve routing problem of service composition based on an improved ant colony algorithm is proposed. Firstly, based on the traditional ant colony algorithm, the constraints of it are improved. Secondly, a problem solving model for improved ant colony algorithm is established, and the solving process is presented. Finally, simulation experiment will show that improved ant colony algorithm is more applicable in solving routing problem of service composition.","PeriodicalId":6302,"journal":{"name":"2010 International Conference on E-Product E-Service and E-Entertainment","volume":"68 1","pages":"1-4"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 International Conference on E-Product E-Service and E-Entertainment","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICEEE.2010.5660998","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

To improve the adaptability and stability of Dijkstra algorithm for solving routing problem of service composition, a method to solve routing problem of service composition based on an improved ant colony algorithm is proposed. Firstly, based on the traditional ant colony algorithm, the constraints of it are improved. Secondly, a problem solving model for improved ant colony algorithm is established, and the solving process is presented. Finally, simulation experiment will show that improved ant colony algorithm is more applicable in solving routing problem of service composition.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
服务组合路由问题的改进蚁群算法研究
为了提高Dijkstra算法求解服务组合路由问题的适应性和稳定性，提出了一种基于改进蚁群算法求解服务组合路由问题的方法。首先，在传统蚁群算法的基础上，对其约束条件进行了改进;其次，建立了改进蚁群算法的问题求解模型，给出了求解过程。最后，仿真实验表明，改进的蚁群算法更适用于解决服务组合路由问题。
本文章由计算机程序翻译，如有差异，请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
2010 International Conference on E-Product E-Service and E-Entertainment
2010 International Conference on E-Product E-Service and E-Entertainment
自引率
0.00%
发文量
0
期刊最新文献
Simulation of Temperature Impact on Mass Fraction on Cathode-Upward in the Cathode of PEM Fuel Cell A Supply Chain Coordination Model for Multiple Retailers under Supply Chain Management Patent Protection and the Structural Transformation of Import Trade in China Study on Identification of Driver's Intentions Based on Cloud Model A Life-Time Monitoring Device of Surge Arrester with Series Gap
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们：info@booksci.cn
Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1