Publications

Detailed Information

Optimization Models and Decomposition Approaches for the Power System Operation under Uncertainty : 불확실성 하에서의 전력시스템 운영에 대한 최적화 모형과 분해기법

DC Field Value Language
dc.contributor.advisor이경식-
dc.contributor.author이종헌-
dc.date.accessioned2023-11-20T04:18:23Z-
dc.date.available2023-11-20T04:18:23Z-
dc.date.issued2023-
dc.identifier.other000000177696-
dc.identifier.urihttps://hdl.handle.net/10371/196335-
dc.identifier.urihttps://dcollection.snu.ac.kr/common/orgView/000000177696ko_KR
dc.description학위논문(박사) -- 서울대학교대학원 : 공과대학 산업공학과, 2023. 8. 이경식.-
dc.description.abstractPower systems consist of generation, transmission, and distribution systems indicating the electricity network from its generation to the loads. Among various optimization problems in the system, the unit commitment (UC) problem is a fundamental problem that aims to minimize operation costs while meeting electricity demand by coordinating generation resources. To ensure effective and reliable operation, various uncertain factors such as renewable generation, load demand, and contingencies should appropriately be considered. However, since the computational burden increases as uncertain factors are incorporated into the optimization models, efficient models and solution approaches are needed. Thus, this dissertation aims to propose optimization models and decomposition methods to solve optimization problems in power system operation under uncertainty.

First, we investigate a novel modeling approach in two-stage stochastic programming, which is a widely used framework in power system operations under uncertainty. We propose a partition-based risk-averse two-stage stochastic program that mitigates the drawbacks of the traditional two-stage stochastic programs with finite support. In the model, a set of scenarios is partitioned into several groups a second-stage cost is represented as the expectation of conditional value-at-risks of costs for each scenario group. We propose decomposition methods based on column-and-constraint generation to solve the model exactly for a given partition. In addition, a scenario partitioning method to enable the risk level of the model to be close to a given target is devised, and partitioning schemes for combining it with the proposed column-and-constraint generation algorithm are proposed. Numerical experiments were performed that demonstrated the effectiveness of the proposed partitioning schemes and the efficiency of the proposed solution approach.

Next, we address single-unit commitment (1UC) problems, which arise when an individual power producer bids a generator's schedule to the deregulated electricity market. Especially, we devise efficient dynamic programming algorithms to solve 1UC problems under stochastic electricity prices, by extending the results in the deterministic counterpart. Furthermore, leveraging the efficient algorithms on 1UC problems, we present two unit decomposition frameworks to solve the general UC problem under stochastic net load, which include a novel decomposition that has not been proposed. We propose a total of four solution approaches based on Lagrangian relaxation or column generation and analyze the dual bounds obtained from the methods. Through the numerical experiments, we demonstrate the efficiency of the proposed algorithms on 1UC problems. In addition, we analyze various unit decomposition methods for the stochastic UC problems and emphasize the scalability of the proposed novel column generation method with regard to the number of scenarios.

Finally, we study optimization models for microgrid operation under stochastic islanding and net load, where a microgrid is a localized power system with various distributed energy resources having the distinguishing feature that can be operated in an islanded or connected mode. Although multistage stochastic optimization models can address the dynamics and probabilistic nature of uncertainty, they suffer from the curse of dimensionality in that the number of scenarios grows exponentially with regard to the number of time periods. To overcome this drawback, we propose scalable optimization models to operate a microgrid under both uncertain factors. To deal with uncertain islanding events, a replanning procedure with models that consider at most one upcoming islanding event is proposed. To incorporate stochastic net load, the range of generation is determined in addition to commitment decisions to reduce the size of the model. Numerical experiments demonstrate that practical-sized instances can be solved using the proposed models, whereas they cannot be solved using the standard multistage model. The results also demonstrate the effectiveness of the solutions from the proposed models in an environment that both stochastic factors sequentially realize.
-
dc.description.tableofcontentsChapter 1 Introduction 1
1.1 Backgrounds 1
1.1.1 Optimization problems in power systems 1
1.1.2 Unit commitment problem in power systems 4
1.1.3 Optimization under uncertainty 6
1.2 Literature review 9
1.2.1 Studies on unit commitment problems 9
1.2.2 Optimization approaches under uncertainty in power system operation 11
1.3 Research motivations and contributions 15
1.4 Outline of the dissertation 18
Chapter 2 Partition-based risk-averse two-stage stochastic program 21
2.1 Introduction 21
2.2 Literature review and contributions 25
2.3 Column-and-constraint generation approaches for the PSP 30
2.3.1 Primal column-and-constraint generation algorithm 31
2.3.2 Dual column-and-constraint generation and comparison 38
2.4 Scenario partitioning methods 40
2.4.1 Partitioning algorithm 43
2.4.2 Partitioning schemes 45
2.5 Computational experiments 49
2.5.1 Two-stage stochastic unit commitment problem 49
2.5.2 Experimental setup 51
2.5.3 Experimental results 52
2.6 Summary 59
Chapter 3 Single unit commitment under uncertainty and its application to unit decomposition approaches 61
3.1 Introduction 61
3.2 Algorithms for the single-unit commitment problem under price uncertainty 67
3.2.1 Dynamic programming algorithm for the stochastic self-scheduling problem 67
3.2.2 Dynamic programming algorithm for the self-commitment problem 73
3.3 Unit decomposition approaches for the unit commitment problem under stochastic net load 77
3.3.1 Schedule decomposition 79
3.3.2 Commitment decomposition 82
3.3.3 Comparison of the dual bounds 87
3.3.4 Upper bounding 91
3.3.5 Implementation details 92
3.4 Computational experiments 93
3.4.1 Results on single-unit commitment problems 94
3.4.2 Results on unit decomposition methods 97
3.5 Summary 103
Chapter 4 Scalable optimization approaches for microgrid operation under stochastic islanding and net load 107
4.1 Introduction 107
4.2 Standard multistage stochastic optimization model 113
4.3 Proposed optimization models 119
4.3.1 Optimization models and replanning procedure under islanding uncertainty 119
4.3.2 Scalable optimization models under net load uncertainty 124
4.3.3 Integrated optimization models for both islanding and net load uncertainty 131
4.4 Computational experiments 134
4.4.1 Effectiveness of proposed model with replanning procedure under islanding uncertainty 136
4.4.2 Effectiveness of proposed model under net load uncertainty 138
4.4.3 Effectiveness of integrated model under both uncertain factors 140
4.5 Summary 142
Chapter 5 Conclusion 145
5.1 Summary and contributions 145
5.2 Future research directions 148
Bibliography 153
Appendix A Additional test results in Chapter 2 169
국문초록 179
-
dc.format.extentxii,180-
dc.language.isoeng-
dc.publisher서울대학교 대학원-
dc.subjectPower system operation-
dc.subjectOptimization under uncertainty-
dc.subjectUnit commitment-
dc.subjectDecomposition method-
dc.subjectMicrogrid-
dc.subjectStochastic optimizatio-
dc.subject.ddc670.42-
dc.titleOptimization Models and Decomposition Approaches for the Power System Operation under Uncertainty-
dc.title.alternative불확실성 하에서의 전력시스템 운영에 대한 최적화 모형과 분해기법-
dc.typeThesis-
dc.typeDissertation-
dc.contributor.AlternativeAuthorJongheon Lee-
dc.contributor.department공과대학 산업공학과-
dc.description.degree박사-
dc.date.awarded2023-08-
dc.identifier.uciI804:11032-000000177696-
dc.identifier.holdings000000000050▲000000000058▲000000177696▲-
Appears in Collections:
Files in This Item:

Altmetrics

Item View & Download Count

  • mendeley

Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.

Share