{"title":"基于ilp的多周期可生存网络增强问题的启发式方法","authors":"Yali Wang, J. Doucette","doi":"10.1109/RNDM.2016.7608268","DOIUrl":null,"url":null,"abstract":"This paper studies the optimization of a multi-period survivable network augmentation (MPSNA) problem. An integer linear programming (ILP) model is formulated. Because the MPSNA problem is very time-consuming to solve even for a very small network, a four-stage ILP-based heuristic approach is developed. Simulations on six test case networks of various sizes are carried out. The experimental results show that our approach is effective at solving the MPSNA problem.","PeriodicalId":422165,"journal":{"name":"2016 8th International Workshop on Resilient Networks Design and Modeling (RNDM)","volume":"96 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"ILP-based heuristic method for the multi-period survivable network augmentation problem\",\"authors\":\"Yali Wang, J. Doucette\",\"doi\":\"10.1109/RNDM.2016.7608268\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper studies the optimization of a multi-period survivable network augmentation (MPSNA) problem. An integer linear programming (ILP) model is formulated. Because the MPSNA problem is very time-consuming to solve even for a very small network, a four-stage ILP-based heuristic approach is developed. Simulations on six test case networks of various sizes are carried out. The experimental results show that our approach is effective at solving the MPSNA problem.\",\"PeriodicalId\":422165,\"journal\":{\"name\":\"2016 8th International Workshop on Resilient Networks Design and Modeling (RNDM)\",\"volume\":\"96 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 8th International Workshop on Resilient Networks Design and Modeling (RNDM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/RNDM.2016.7608268\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 8th International Workshop on Resilient Networks Design and Modeling (RNDM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RNDM.2016.7608268","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
ILP-based heuristic method for the multi-period survivable network augmentation problem
This paper studies the optimization of a multi-period survivable network augmentation (MPSNA) problem. An integer linear programming (ILP) model is formulated. Because the MPSNA problem is very time-consuming to solve even for a very small network, a four-stage ILP-based heuristic approach is developed. Simulations on six test case networks of various sizes are carried out. The experimental results show that our approach is effective at solving the MPSNA problem.