{"title":"Evaluation of methodologies for shunt VAr planning","authors":"J. A. Jatau, J. Momoh, A. Chuku","doi":"10.1109/NAPS.1990.151392","DOIUrl":null,"url":null,"abstract":"Two methods are developed and evaluated for shunt VAr planning. These methods are capable of sizing and siting shunt VAr at optimum cost and with greater reliability. The methods utilize the generalized Benders decomposition (GBD) technique to decompose the VAr problem into two subproblems. The first level of the problem solves an optimal power flow problem by scheduling control variables including existing VAr sources. The two methods for the second-level discrete allocation process use a branch-and-bound enumeration technique and a mixed-integer linear programming technique. The constraints include security while minimizing the total investment cost. Tests on the IEEE 14-bus system have shown both algorithms to be robust and fast.<<ETX>>","PeriodicalId":330083,"journal":{"name":"Proceedings of the Twenty-Second Annual North American Power Symposium","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1990-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Twenty-Second Annual North American Power Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NAPS.1990.151392","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
Two methods are developed and evaluated for shunt VAr planning. These methods are capable of sizing and siting shunt VAr at optimum cost and with greater reliability. The methods utilize the generalized Benders decomposition (GBD) technique to decompose the VAr problem into two subproblems. The first level of the problem solves an optimal power flow problem by scheduling control variables including existing VAr sources. The two methods for the second-level discrete allocation process use a branch-and-bound enumeration technique and a mixed-integer linear programming technique. The constraints include security while minimizing the total investment cost. Tests on the IEEE 14-bus system have shown both algorithms to be robust and fast.<>