{"title":"径向网络电压/无功控制的混合整数优化","authors":"M. Knaiber, R. Jabr","doi":"10.1109/REDEC.2018.8598089","DOIUrl":null,"url":null,"abstract":"Due to the increase in load demand and capacity of distributed generation, radial distribution systems are exposed to voltage violation problems. Volt/VAr control (VVC) has a primary objective of removing voltage violations, and a secondary objective of minimizing the real power loss. Volt/VAr control operates on capacitor switches, transformer taps, and the reactive power set-points of distributed generation. In this paper, the VVC problem is solved using mixed-integer conic programming to establish a globally optimal benchmark. To improve computational performance, a discrete coordinate-descent algorithm is employed, starting from a solution to the continuous relaxation of the VVC mixed-integer conic program. Numerical results are reported on radial distribution networks with up to 3146 nodes. The results reveal that the discrete coordinate-descent algorithm, when initialized by solving a continuous conic program, can give solutions that are very close to the global optimum; these solutions are obtained within a very reasonable computing time and are superior to initiating the search from the current operating point.","PeriodicalId":426643,"journal":{"name":"2018 4th International Conference on Renewable Energies for Developing Countries (REDEC)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Mixed-Integer Optimization for Volt/VAr Control in Radial Networks\",\"authors\":\"M. Knaiber, R. Jabr\",\"doi\":\"10.1109/REDEC.2018.8598089\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Due to the increase in load demand and capacity of distributed generation, radial distribution systems are exposed to voltage violation problems. Volt/VAr control (VVC) has a primary objective of removing voltage violations, and a secondary objective of minimizing the real power loss. Volt/VAr control operates on capacitor switches, transformer taps, and the reactive power set-points of distributed generation. In this paper, the VVC problem is solved using mixed-integer conic programming to establish a globally optimal benchmark. To improve computational performance, a discrete coordinate-descent algorithm is employed, starting from a solution to the continuous relaxation of the VVC mixed-integer conic program. Numerical results are reported on radial distribution networks with up to 3146 nodes. The results reveal that the discrete coordinate-descent algorithm, when initialized by solving a continuous conic program, can give solutions that are very close to the global optimum; these solutions are obtained within a very reasonable computing time and are superior to initiating the search from the current operating point.\",\"PeriodicalId\":426643,\"journal\":{\"name\":\"2018 4th International Conference on Renewable Energies for Developing Countries (REDEC)\",\"volume\":\"13 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 4th International Conference on Renewable Energies for Developing Countries (REDEC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/REDEC.2018.8598089\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 4th International Conference on Renewable Energies for Developing Countries (REDEC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/REDEC.2018.8598089","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Mixed-Integer Optimization for Volt/VAr Control in Radial Networks
Due to the increase in load demand and capacity of distributed generation, radial distribution systems are exposed to voltage violation problems. Volt/VAr control (VVC) has a primary objective of removing voltage violations, and a secondary objective of minimizing the real power loss. Volt/VAr control operates on capacitor switches, transformer taps, and the reactive power set-points of distributed generation. In this paper, the VVC problem is solved using mixed-integer conic programming to establish a globally optimal benchmark. To improve computational performance, a discrete coordinate-descent algorithm is employed, starting from a solution to the continuous relaxation of the VVC mixed-integer conic program. Numerical results are reported on radial distribution networks with up to 3146 nodes. The results reveal that the discrete coordinate-descent algorithm, when initialized by solving a continuous conic program, can give solutions that are very close to the global optimum; these solutions are obtained within a very reasonable computing time and are superior to initiating the search from the current operating point.