Eylem Seç
Mixed Integer Conic Programming Formulation of Distribution Optimal Power Flow and Unit Commitment Problems
Başlık:
Mixed Integer Conic Programming Formulation of Distribution Optimal Power Flow and Unit Commitment Problems
Yazar:
Shukla, Sharabh Ramshiromani, author. (orcid)0000-0002-2841-2897
ISBN:
9780355979527
Yazar Ek Girişi:
Fiziksel Tanımlama:
1 electronic resource (127 pages)
Genel Not:
Source: Masters Abstracts International, Volume: 57-06M(E).
Advisors: Sumit Paudyal Committee members: Mads R. Almassalkhi; Daniel R. Fuhrmann.
Özet:
Recent trend shows increased interests on Distribution Optimal Power Flow (DOPF) problems. DOPF is used for coordinating dispatchable assets for optimal operations of distribution grids. However, DOPF is a non-convex optimization problem which is challenging to solve. Increased penetration of Distributed Energy Resources (DERs) and flexible loads, though beneficial, also brings challenges as the problem size of DOPF increases. These controllable DERs and flexible loads, together with discrete integer controls such as tap changers and capacitor banks, make the problem intractable to state-of-the-art commercial solvers. As a result, solving large scale DOPF with discreet integer variables has been identified as a challenging problem in power system. Recent advancements in convex relaxations of DOPF permit globally optimal solution to be discovered with polynomial time algorithms. In this work, Low's conic power flow model is used as the underlying model and is extended by modelling discrete controls in the DOPF problem. This work uses a conic reformulation of discrete transformer tap controls. The proposed model is a Mixed Integer Second Order Conic Programming (MISOCP) model. A novel algorithm, Sequential Bound Tightening Algorithm (SBTA), is also developed to solve the proposed model. The algorithm improves accuracy and the formulation along with the algorithm permits computational tractability on practical-sized systems. The proposed model and the algorithm are tested and benchmarked against the results from a standard Mixed Integer Nonlinear Programming (MINLP) model. The results show that the model is sufficiently accurate and scales well on larger systems.
Unit Commitment (UC) is another fundamental problem in power system that seeks to allocate an operating schedule to generators while maximizing social welfare. The UC as an MINLP problem can get intractable on practical-sized systems. In this work, a Mixed Integer Conic Reformulation of the UC problem is proposed whose computational efficiency is further enhanced by incorporating convex hull of difficult inter-temporal constraints. The results show that the proposed model outperforms MINLP by a large factor and it even outperforms commonly used MILP model on larger systems.
Notlar:
School code: 0129
Tüzel Kişi Ek Girişi:
Mevcut:*
Yer Numarası | Demirbaş Numarası | Shelf Location | Lokasyon / Statüsü / İade Tarihi |
---|---|---|---|
XX(690673.1) | 690673-1001 | Proquest E-Tez Koleksiyonu | Arıyor... |
On Order
Liste seç
Bunu varsayılan liste yap.
Öğeler başarıyla eklendi
Öğeler eklenirken hata oldu. Lütfen tekrar deneyiniz.
:
Select An Item
Data usage warning: You will receive one text message for each title you selected.
Standard text messaging rates apply.