{"title":"A Second-Order Cone Relaxation Based Method for Optimal Power Flow of Meshed Networks","authors":"Yuwei Chen, Bingqing Xia, Chenggen Xu, Qing Chen, Zhaohui Shi, Songge Huang","doi":"10.1109/CEEPE55110.2022.9783365","DOIUrl":null,"url":null,"abstract":"Due to the stability consideration of power systems, the meshed topology of the network has become common. This paper proposes a second-order cone relaxation based method for the optimal power flow problem of meshed networks. The method imposes four sets of second-order cone relaxations to convexify the non-convex power flow constraints. Besides, the convex concave procedure with penalty has been implemented to prompt exact relaxations. Within few times of iterations, a feasible solution which is near the global optimum can be obtained. The superiority of the proposed approach has been tested over the case study.","PeriodicalId":118143,"journal":{"name":"2022 5th International Conference on Energy, Electrical and Power Engineering (CEEPE)","volume":"275 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 5th International Conference on Energy, Electrical and Power Engineering (CEEPE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CEEPE55110.2022.9783365","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
Due to the stability consideration of power systems, the meshed topology of the network has become common. This paper proposes a second-order cone relaxation based method for the optimal power flow problem of meshed networks. The method imposes four sets of second-order cone relaxations to convexify the non-convex power flow constraints. Besides, the convex concave procedure with penalty has been implemented to prompt exact relaxations. Within few times of iterations, a feasible solution which is near the global optimum can be obtained. The superiority of the proposed approach has been tested over the case study.