{"title":"服务组合路由问题的改进蚁群算法研究","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":"{\"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}","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}
The Study of Improved Ant Colony Algorithm for Routing Problem of Service Composition
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
