{"title":"应用遗传算法和模拟退火算法求解组合优化问题","authors":"M. Chakraborty, Uday K. Chakraborty","doi":"10.1109/ICICS.1997.652115","DOIUrl":null,"url":null,"abstract":"This paper applies the genetic algorithm and simulated annealing to the problem of optimal link enhancement, which is an NP-complete combinatorial optimization problem in the topological expansion of computer communication networks. Experimental results show that simulated annealing outperforms the genetic algorithm on this problem.","PeriodicalId":71361,"journal":{"name":"信息通信技术","volume":"6 1","pages":"929-933 vol.2"},"PeriodicalIF":0.0000,"publicationDate":"1997-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":"{\"title\":\"Applying genetic algorithm and simulated annealing to a combinatorial optimization problem\",\"authors\":\"M. Chakraborty, Uday K. Chakraborty\",\"doi\":\"10.1109/ICICS.1997.652115\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper applies the genetic algorithm and simulated annealing to the problem of optimal link enhancement, which is an NP-complete combinatorial optimization problem in the topological expansion of computer communication networks. Experimental results show that simulated annealing outperforms the genetic algorithm on this problem.\",\"PeriodicalId\":71361,\"journal\":{\"name\":\"信息通信技术\",\"volume\":\"6 1\",\"pages\":\"929-933 vol.2\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1997-09-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"12\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"信息通信技术\",\"FirstCategoryId\":\"1093\",\"ListUrlMain\":\"https://doi.org/10.1109/ICICS.1997.652115\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"信息通信技术","FirstCategoryId":"1093","ListUrlMain":"https://doi.org/10.1109/ICICS.1997.652115","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Applying genetic algorithm and simulated annealing to a combinatorial optimization problem
This paper applies the genetic algorithm and simulated annealing to the problem of optimal link enhancement, which is an NP-complete combinatorial optimization problem in the topological expansion of computer communication networks. Experimental results show that simulated annealing outperforms the genetic algorithm on this problem.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
