{"title":"多约束组播路由的改进蚁群算法","authors":"Hua Wang, Zhao Shi, Jun Ma","doi":"10.1109/CHINACOM.2006.344753","DOIUrl":null,"url":null,"abstract":"This paper proposes a modified ant colony algorithm and applies it to multi-constraint multicast routing problem. This modified algorithm adds the orientation factor to the basic ant colony algorithm, which enables the ant to get rid of the initial blindness when searching paths. This makes use of the search results and reduces the misguiding function of pheromone on irrelevant paths, thus overcoming the drawbacks of slow convergence existing in the basic ant colony algorithm. The simulation results show that the accuracy and convergence speed of the modified algorithm are better than those of the basic ant colony algorithm.","PeriodicalId":408368,"journal":{"name":"2006 First International Conference on Communications and Networking in China","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"A Modified Ant Colony Algorithm for Multi-constraint Multicast Routing\",\"authors\":\"Hua Wang, Zhao Shi, Jun Ma\",\"doi\":\"10.1109/CHINACOM.2006.344753\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposes a modified ant colony algorithm and applies it to multi-constraint multicast routing problem. This modified algorithm adds the orientation factor to the basic ant colony algorithm, which enables the ant to get rid of the initial blindness when searching paths. This makes use of the search results and reduces the misguiding function of pheromone on irrelevant paths, thus overcoming the drawbacks of slow convergence existing in the basic ant colony algorithm. The simulation results show that the accuracy and convergence speed of the modified algorithm are better than those of the basic ant colony algorithm.\",\"PeriodicalId\":408368,\"journal\":{\"name\":\"2006 First International Conference on Communications and Networking in China\",\"volume\":\"31 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 First International Conference on Communications and Networking in China\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CHINACOM.2006.344753\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 First International Conference on Communications and Networking in China","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CHINACOM.2006.344753","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Modified Ant Colony Algorithm for Multi-constraint Multicast Routing
This paper proposes a modified ant colony algorithm and applies it to multi-constraint multicast routing problem. This modified algorithm adds the orientation factor to the basic ant colony algorithm, which enables the ant to get rid of the initial blindness when searching paths. This makes use of the search results and reduces the misguiding function of pheromone on irrelevant paths, thus overcoming the drawbacks of slow convergence existing in the basic ant colony algorithm. The simulation results show that the accuracy and convergence speed of the modified algorithm are better than those of the basic ant colony algorithm.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
