Yaowen Yu, P. Luh, E. Litvinov, T. Zheng, Jinye Zhao, F. Zhao, Dane A. Schiro
{"title":"基于区间优化的可再生能源高渗透率输电权变约束机组承诺","authors":"Yaowen Yu, P. Luh, E. Litvinov, T. Zheng, Jinye Zhao, F. Zhao, Dane A. Schiro","doi":"10.1109/PESGM41954.2020.9281490","DOIUrl":null,"url":null,"abstract":"Reliability is an overriding concern for power systems that involve different types of uncertainty including contingencies and intermittent renewables. Contingency-constrained unit commitment (CCUC) satisfying the “N – 1 rule” is extremely complex, and the complexity is now compounded by the drastic increase in renewables. This paper develops a novel interval optimization approach for CCUC with N – 1 transmission contingencies and renewable generation. A large number of transmission contingencies are innovatively described by treating corresponding generation shift factors (GSFs) as uncertain parameters varying within intervals. To ensure solution robustness, bounds of GSFs and renewables in different types of constraints are captured based on interval optimization. The resulting model is a mixed-integer linear programming problem. To alleviate its conservativeness and to further reduce the problem size, ranges of GSFs are shrunk through identifying and removing redundant transmission constraints. To solve large-scale problems, Surrogate Lagrangian Relaxation (SLR) and branch-and-cut (B&C) are used to simultaneously exploit separability and linearity. Numerical results demonstrate that the new approach is effective in terms of computational efficiency, solution robustness, and simulation costs.","PeriodicalId":106476,"journal":{"name":"2020 IEEE Power & Energy Society General Meeting (PESGM)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Transmission Contingency-Constrained Unit Commitment with High Penetration of Renewables via Interval Optimization\",\"authors\":\"Yaowen Yu, P. Luh, E. Litvinov, T. Zheng, Jinye Zhao, F. Zhao, Dane A. Schiro\",\"doi\":\"10.1109/PESGM41954.2020.9281490\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Reliability is an overriding concern for power systems that involve different types of uncertainty including contingencies and intermittent renewables. Contingency-constrained unit commitment (CCUC) satisfying the “N – 1 rule” is extremely complex, and the complexity is now compounded by the drastic increase in renewables. This paper develops a novel interval optimization approach for CCUC with N – 1 transmission contingencies and renewable generation. A large number of transmission contingencies are innovatively described by treating corresponding generation shift factors (GSFs) as uncertain parameters varying within intervals. To ensure solution robustness, bounds of GSFs and renewables in different types of constraints are captured based on interval optimization. The resulting model is a mixed-integer linear programming problem. To alleviate its conservativeness and to further reduce the problem size, ranges of GSFs are shrunk through identifying and removing redundant transmission constraints. To solve large-scale problems, Surrogate Lagrangian Relaxation (SLR) and branch-and-cut (B&C) are used to simultaneously exploit separability and linearity. Numerical results demonstrate that the new approach is effective in terms of computational efficiency, solution robustness, and simulation costs.\",\"PeriodicalId\":106476,\"journal\":{\"name\":\"2020 IEEE Power & Energy Society General Meeting (PESGM)\",\"volume\":\"10 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-08-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 IEEE Power & Energy Society General Meeting (PESGM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PESGM41954.2020.9281490\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE Power & Energy Society General Meeting (PESGM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PESGM41954.2020.9281490","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Transmission Contingency-Constrained Unit Commitment with High Penetration of Renewables via Interval Optimization
Reliability is an overriding concern for power systems that involve different types of uncertainty including contingencies and intermittent renewables. Contingency-constrained unit commitment (CCUC) satisfying the “N – 1 rule” is extremely complex, and the complexity is now compounded by the drastic increase in renewables. This paper develops a novel interval optimization approach for CCUC with N – 1 transmission contingencies and renewable generation. A large number of transmission contingencies are innovatively described by treating corresponding generation shift factors (GSFs) as uncertain parameters varying within intervals. To ensure solution robustness, bounds of GSFs and renewables in different types of constraints are captured based on interval optimization. The resulting model is a mixed-integer linear programming problem. To alleviate its conservativeness and to further reduce the problem size, ranges of GSFs are shrunk through identifying and removing redundant transmission constraints. To solve large-scale problems, Surrogate Lagrangian Relaxation (SLR) and branch-and-cut (B&C) are used to simultaneously exploit separability and linearity. Numerical results demonstrate that the new approach is effective in terms of computational efficiency, solution robustness, and simulation costs.